./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 14:56:40,929 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 14:56:40,931 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 14:56:40,979 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 14:56:40,979 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 14:56:40,992 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 14:56:40,993 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 14:56:40,995 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 14:56:40,996 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 14:56:41,000 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 14:56:41,001 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 14:56:41,002 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 14:56:41,002 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 14:56:41,004 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 14:56:41,005 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 14:56:41,006 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 14:56:41,007 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 14:56:41,008 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 14:56:41,022 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 14:56:41,026 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 14:56:41,027 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 14:56:41,028 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 14:56:41,029 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 14:56:41,029 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 14:56:41,035 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 14:56:41,035 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 14:56:41,036 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 14:56:41,037 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 14:56:41,037 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 14:56:41,038 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 14:56:41,038 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 14:56:41,039 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 14:56:41,040 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 14:56:41,041 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 14:56:41,042 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 14:56:41,042 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 14:56:41,042 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 14:56:41,042 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 14:56:41,043 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 14:56:41,043 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 14:56:41,044 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 14:56:41,044 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 14:56:41,083 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 14:56:41,083 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 14:56:41,083 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 14:56:41,089 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 14:56:41,090 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 14:56:41,090 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 14:56:41,091 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 14:56:41,091 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 14:56:41,091 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 14:56:41,091 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 14:56:41,092 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 14:56:41,092 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 14:56:41,092 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 14:56:41,093 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 14:56:41,093 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 14:56:41,093 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 14:56:41,093 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 14:56:41,093 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 14:56:41,093 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 14:56:41,094 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 14:56:41,094 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 14:56:41,094 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 14:56:41,094 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 14:56:41,094 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 14:56:41,094 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 14:56:41,095 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 14:56:41,095 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:56:41,095 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 14:56:41,095 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 14:56:41,095 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 14:56:41,096 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 14:56:41,096 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 14:56:41,096 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 14:56:41,097 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 14:56:41,097 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 14:56:41,097 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 14:56:41,097 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 14:56:41,097 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
[2023-10-25 14:56:41,478 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 14:56:41,501 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 14:56:41,504 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 14:56:41,504 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 14:56:41,505 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 14:56:41,518 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-10-25 14:56:43,178 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 14:56:43,605 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 14:56:43,607 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-10-25 14:56:43,625 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/584a1ae87/1e855b1715624980bd87dbe751174c29/FLAG77d34152b
[2023-10-25 14:56:43,662 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/584a1ae87/1e855b1715624980bd87dbe751174c29
[2023-10-25 14:56:43,664 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 14:56:43,665 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 14:56:43,668 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 14:56:43,668 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 14:56:43,670 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 14:56:43,670 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:56:43" (1/1) ...
[2023-10-25 14:56:43,672 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666eead4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:43, skipping insertion in model container
[2023-10-25 14:56:43,672 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:56:43" (1/1) ...
[2023-10-25 14:56:43,681 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 14:56:43,737 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 14:56:43,991 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:56:44,300 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:56:44,308 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 14:56:44,342 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 14:56:44,384 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 14:56:44,465 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 14:56:44,466 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44 WrapperNode
[2023-10-25 14:56:44,466 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 14:56:44,470 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 14:56:44,470 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 14:56:44,470 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 14:56:44,476 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,515 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,568 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-10-25 14:56:44,569 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 14:56:44,569 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 14:56:44,570 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 14:56:44,583 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 14:56:44,590 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,590 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,603 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,609 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,616 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,631 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,635 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,636 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,646 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 14:56:44,646 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 14:56:44,647 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 14:56:44,647 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 14:56:44,647 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (1/1) ...
[2023-10-25 14:56:44,651 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 14:56:44,676 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:44,700 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 14:56:44,726 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 14:56:44,748 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 14:56:44,748 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 14:56:44,749 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 14:56:44,751 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 14:56:44,751 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 14:56:44,751 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 14:56:44,751 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 14:56:44,752 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 14:56:44,752 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 14:56:44,752 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 14:56:44,752 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 14:56:44,753 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 14:56:44,988 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 14:56:45,002 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 14:56:45,436 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 14:56:45,442 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 14:56:45,461 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 14:56:45,463 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:56:45 BoogieIcfgContainer
[2023-10-25 14:56:45,464 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 14:56:45,471 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 14:56:45,472 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 14:56:45,475 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 14:56:45,475 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:56:43" (1/3) ...
[2023-10-25 14:56:45,476 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc9162f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:56:45, skipping insertion in model container
[2023-10-25 14:56:45,476 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:56:44" (2/3) ...
[2023-10-25 14:56:45,477 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc9162f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:56:45, skipping insertion in model container
[2023-10-25 14:56:45,477 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:56:45" (3/3) ...
[2023-10-25 14:56:45,479 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2023-10-25 14:56:45,498 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 14:56:45,505 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 14:56:45,506 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-10-25 14:56:45,506 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 14:56:45,631 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 14:56:45,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-25 14:56:45,818 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-25 14:56:45,819 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:45,830 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-25 14:56:45,830 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-10-25 14:56:45,851 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-10-25 14:56:45,854 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:56:45,873 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-25 14:56:45,880 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-10-25 14:56:45,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-10-25 14:56:45,939 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-10-25 14:56:45,950 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 14:56:45,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-10-25 14:56:45,959 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-10-25 14:56:49,284 INFO  L134        LiptonReduction]: Checked pairs total: 9489
[2023-10-25 14:56:49,293 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-10-25 14:56:49,320 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:56:49,346 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66cd24a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:56:49,346 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-25 14:56:49,349 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-25 14:56:49,349 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:56:49,349 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:49,350 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:49,350 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:56:49,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:49,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 1980212676, now seen corresponding path program 1 times
[2023-10-25 14:56:49,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:49,376 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546420502]
[2023-10-25 14:56:49,376 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:49,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:49,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:50,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:50,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:50,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546420502]
[2023-10-25 14:56:50,312 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546420502] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:50,312 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:50,312 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:50,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279341050]
[2023-10-25 14:56:50,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:50,320 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:50,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:50,349 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:50,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:50,811 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2023-10-25 14:56:50,814 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:50,814 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:50,814 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2023-10-25 14:56:50,815 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:51,070 INFO  L130       PetriNetUnfolder]: 146/507 cut-off events.
[2023-10-25 14:56:51,070 INFO  L131       PetriNetUnfolder]: For 4/8 co-relation queries the response was YES.
[2023-10-25 14:56:51,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 870 conditions, 507 events. 146/507 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2712 event pairs, 42 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 784. Up to 226 conditions per place. 
[2023-10-25 14:56:51,078 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 47 selfloop transitions, 23 changer transitions 0/98 dead transitions.
[2023-10-25 14:56:51,078 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 344 flow
[2023-10-25 14:56:51,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:51,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:51,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions.
[2023-10-25 14:56:51,109 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-10-25 14:56:51,110 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 660 transitions.
[2023-10-25 14:56:51,110 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions.
[2023-10-25 14:56:51,114 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:51,116 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions.
[2023-10-25 14:56:51,130 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:51,136 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:51,136 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:51,138 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 660 transitions.
[2023-10-25 14:56:51,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 344 flow
[2023-10-25 14:56:51,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:51,166 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-10-25 14:56:51,167 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-10-25 14:56:51,170 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-10-25 14:56:51,171 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-10-25 14:56:51,171 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:51,171 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:51,171 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:51,172 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 14:56:51,173 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:56:51,173 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:51,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641346575, now seen corresponding path program 1 times
[2023-10-25 14:56:51,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:51,176 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862893254]
[2023-10-25 14:56:51,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:51,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:51,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:51,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:51,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:51,497 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862893254]
[2023-10-25 14:56:51,497 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862893254] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:51,498 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:51,498 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:51,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923063889]
[2023-10-25 14:56:51,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:51,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:51,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:51,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:51,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:51,796 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2023-10-25 14:56:51,797 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:51,797 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:51,798 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2023-10-25 14:56:51,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:52,149 INFO  L130       PetriNetUnfolder]: 284/850 cut-off events.
[2023-10-25 14:56:52,150 INFO  L131       PetriNetUnfolder]: For 332/338 co-relation queries the response was YES.
[2023-10-25 14:56:52,151 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 850 events. 284/850 cut-off events. For 332/338 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5116 event pairs, 51 based on Foata normal form. 5/813 useless extension candidates. Maximal degree in co-relation 1873. Up to 398 conditions per place. 
[2023-10-25 14:56:52,155 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 73 selfloop transitions, 50 changer transitions 0/152 dead transitions.
[2023-10-25 14:56:52,155 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 152 transitions, 799 flow
[2023-10-25 14:56:52,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:52,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:52,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions.
[2023-10-25 14:56:52,157 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5439932318104906
[2023-10-25 14:56:52,157 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 643 transitions.
[2023-10-25 14:56:52,157 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions.
[2023-10-25 14:56:52,158 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:52,158 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions.
[2023-10-25 14:56:52,160 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:52,164 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:52,168 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:52,169 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 643 transitions.
[2023-10-25 14:56:52,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 152 transitions, 799 flow
[2023-10-25 14:56:52,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:52,188 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-10-25 14:56:52,189 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2023-10-25 14:56:52,189 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-10-25 14:56:52,189 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-10-25 14:56:52,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:52,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:52,190 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:52,190 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 14:56:52,191 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:56:52,191 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:52,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 61135557, now seen corresponding path program 1 times
[2023-10-25 14:56:52,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:52,192 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19379148]
[2023-10-25 14:56:52,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:52,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:52,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:52,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:52,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:52,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19379148]
[2023-10-25 14:56:52,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19379148] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:52,558 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:52,558 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:52,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228730647]
[2023-10-25 14:56:52,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:52,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:52,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:52,560 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:52,561 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:52,973 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2023-10-25 14:56:52,974 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:52,974 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:52,974 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2023-10-25 14:56:52,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:53,228 INFO  L130       PetriNetUnfolder]: 280/858 cut-off events.
[2023-10-25 14:56:53,229 INFO  L131       PetriNetUnfolder]: For 1118/1126 co-relation queries the response was YES.
[2023-10-25 14:56:53,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 858 events. 280/858 cut-off events. For 1118/1126 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5295 event pairs, 47 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 2418. Up to 429 conditions per place. 
[2023-10-25 14:56:53,233 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 76 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-10-25 14:56:53,245 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1243 flow
[2023-10-25 14:56:53,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:53,246 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:53,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2023-10-25 14:56:53,248 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651438240270727
[2023-10-25 14:56:53,248 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2023-10-25 14:56:53,248 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2023-10-25 14:56:53,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:53,248 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2023-10-25 14:56:53,250 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:53,252 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:53,252 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:53,252 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 668 transitions.
[2023-10-25 14:56:53,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1243 flow
[2023-10-25 14:56:53,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1243 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:53,273 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-10-25 14:56:53,273 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2023-10-25 14:56:53,274 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-10-25 14:56:53,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-10-25 14:56:53,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:53,275 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:53,275 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:53,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 14:56:53,279 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:56:53,279 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:53,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282532369, now seen corresponding path program 1 times
[2023-10-25 14:56:53,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:53,280 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477304358]
[2023-10-25 14:56:53,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:53,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:53,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:53,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:53,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:53,715 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477304358]
[2023-10-25 14:56:53,716 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477304358] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:56:53,716 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:56:53,716 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:56:53,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301403059]
[2023-10-25 14:56:53,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:56:53,717 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:56:53,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:53,718 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:56:53,718 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:56:53,874 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2023-10-25 14:56:53,875 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:53,875 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:53,875 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2023-10-25 14:56:53,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:54,384 INFO  L130       PetriNetUnfolder]: 536/1340 cut-off events.
[2023-10-25 14:56:54,385 INFO  L131       PetriNetUnfolder]: For 1846/1860 co-relation queries the response was YES.
[2023-10-25 14:56:54,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1340 events. 536/1340 cut-off events. For 1846/1860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8489 event pairs, 92 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 4685. Up to 994 conditions per place. 
[2023-10-25 14:56:54,410 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 167 selfloop transitions, 111 changer transitions 10/304 dead transitions.
[2023-10-25 14:56:54,410 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 2365 flow
[2023-10-25 14:56:54,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:56:54,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:56:54,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions.
[2023-10-25 14:56:54,412 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.577834179357022
[2023-10-25 14:56:54,413 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 683 transitions.
[2023-10-25 14:56:54,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions.
[2023-10-25 14:56:54,414 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:54,416 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions.
[2023-10-25 14:56:54,418 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:54,420 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:54,421 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:54,421 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 683 transitions.
[2023-10-25 14:56:54,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 2365 flow
[2023-10-25 14:56:54,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2365 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:54,451 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-10-25 14:56:54,452 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2023-10-25 14:56:54,453 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-10-25 14:56:54,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-10-25 14:56:54,467 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:54,467 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:54,467 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:54,467 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 14:56:54,467 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:56:54,468 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:54,468 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889096930, now seen corresponding path program 1 times
[2023-10-25 14:56:54,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:54,468 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133394517]
[2023-10-25 14:56:54,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:54,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:54,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:55,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:55,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:55,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133394517]
[2023-10-25 14:56:55,211 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133394517] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:55,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876037395]
[2023-10-25 14:56:55,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:55,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:55,212 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:55,233 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:56:55,273 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 14:56:55,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:55,403 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 14:56:55,408 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:55,516 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:56:55,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:56:55,795 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:55,797 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:56:55,855 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:55,856 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:55,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:56:55,920 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:55,921 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:55,922 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:55,924 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:56:56,000 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:56,009 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:56:56,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:56,052 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:56,090 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false
[2023-10-25 14:56:56,130 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2023-10-25 14:56:56,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 14:56:56,330 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [876037395] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:56,330 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:56,330 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 14:56:56,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626136604]
[2023-10-25 14:56:56,332 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:56,333 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 14:56:56,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:56,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 14:56:56,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=459, Unknown=2, NotChecked=90, Total=650
[2023-10-25 14:56:56,480 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2023-10-25 14:56:56,482 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:56,482 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:56,482 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2023-10-25 14:56:56,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:56:57,726 INFO  L130       PetriNetUnfolder]: 631/1461 cut-off events.
[2023-10-25 14:56:57,726 INFO  L131       PetriNetUnfolder]: For 3916/3922 co-relation queries the response was YES.
[2023-10-25 14:56:57,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 1461 events. 631/1461 cut-off events. For 3916/3922 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9098 event pairs, 154 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 6378. Up to 1331 conditions per place. 
[2023-10-25 14:56:57,747 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-10-25 14:56:57,748 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-10-25 14:56:57,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-25 14:56:57,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-25 14:56:57,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-10-25 14:56:57,750 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2023-10-25 14:56:57,750 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-10-25 14:56:57,750 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-10-25 14:56:57,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:56:57,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-10-25 14:56:57,752 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:57,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:57,755 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:57,755 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-10-25 14:56:57,755 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-10-25 14:56:57,814 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-10-25 14:56:57,818 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-10-25 14:56:57,818 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2023-10-25 14:56:57,820 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-10-25 14:56:57,820 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-10-25 14:56:57,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:57,821 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:56:57,821 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:56:57,840 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-25 14:56:58,025 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:58,025 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:56:58,026 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:56:58,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 109794428, now seen corresponding path program 1 times
[2023-10-25 14:56:58,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:56:58,026 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839145244]
[2023-10-25 14:56:58,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:58,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:56:58,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:58,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:58,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:56:58,574 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839145244]
[2023-10-25 14:56:58,574 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839145244] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:56:58,574 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769038090]
[2023-10-25 14:56:58,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:56:58,574 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:56:58,575 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:56:58,575 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:56:58,612 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 14:56:58,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:56:58,738 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjunts are in the unsatisfiable core
[2023-10-25 14:56:58,740 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:56:58,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:56:58,840 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:56:58,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:56:58,928 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:58,928 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:56:58,979 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:56:58,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:56:59,075 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:56:59,076 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:56:59,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:56:59,097 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:56:59,125 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-25 14:56:59,185 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:56:59,222 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-25 14:56:59,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 14:56:59,300 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [769038090] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:56:59,300 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:56:59,301 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21
[2023-10-25 14:56:59,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197915559]
[2023-10-25 14:56:59,301 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:56:59,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-10-25 14:56:59,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:56:59,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-10-25 14:56:59,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=304, Unknown=3, NotChecked=114, Total=506
[2023-10-25 14:56:59,463 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2023-10-25 14:56:59,464 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:56:59,464 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:56:59,464 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2023-10-25 14:56:59,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:02,737 INFO  L130       PetriNetUnfolder]: 720/1653 cut-off events.
[2023-10-25 14:57:02,738 INFO  L131       PetriNetUnfolder]: For 3859/3865 co-relation queries the response was YES.
[2023-10-25 14:57:02,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7496 conditions, 1653 events. 720/1653 cut-off events. For 3859/3865 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10567 event pairs, 75 based on Foata normal form. 2/1572 useless extension candidates. Maximal degree in co-relation 7351. Up to 979 conditions per place. 
[2023-10-25 14:57:02,747 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 279 selfloop transitions, 236 changer transitions 41/558 dead transitions.
[2023-10-25 14:57:02,751 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 558 transitions, 4800 flow
[2023-10-25 14:57:02,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-25 14:57:02,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-25 14:57:02,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1554 transitions.
[2023-10-25 14:57:02,766 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3756345177664975
[2023-10-25 14:57:02,767 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1554 transitions.
[2023-10-25 14:57:02,767 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1554 transitions.
[2023-10-25 14:57:02,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:02,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1554 transitions.
[2023-10-25 14:57:02,770 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 74.0) internal successors, (1554), 21 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:02,786 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:02,787 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:02,787 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 21 states and 1554 transitions.
[2023-10-25 14:57:02,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 558 transitions, 4800 flow
[2023-10-25 14:57:02,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 558 transitions, 4770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-10-25 14:57:02,827 INFO  L231             Difference]: Finished difference. Result has 131 places, 395 transitions, 3786 flow
[2023-10-25 14:57:02,834 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3786, PETRI_PLACES=131, PETRI_TRANSITIONS=395}
[2023-10-25 14:57:02,836 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places.
[2023-10-25 14:57:02,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 395 transitions, 3786 flow
[2023-10-25 14:57:02,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:02,838 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:02,848 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:02,854 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:03,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:03,052 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:57:03,053 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:03,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068764240, now seen corresponding path program 1 times
[2023-10-25 14:57:03,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:03,053 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292427702]
[2023-10-25 14:57:03,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:03,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:03,075 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:03,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:03,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:03,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292427702]
[2023-10-25 14:57:03,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292427702] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:03,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469501024]
[2023-10-25 14:57:03,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:03,211 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:03,212 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:03,226 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:03,281 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 14:57:03,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:03,382 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 14:57:03,383 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:03,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:03,429 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:03,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:03,473 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469501024] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:03,473 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:03,473 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 14:57:03,474 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110539199]
[2023-10-25 14:57:03,474 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:03,475 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 14:57:03,475 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:03,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 14:57:03,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 14:57:03,604 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197
[2023-10-25 14:57:03,605 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 395 transitions, 3786 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:03,605 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:03,605 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197
[2023-10-25 14:57:03,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:03,876 INFO  L130       PetriNetUnfolder]: 322/901 cut-off events.
[2023-10-25 14:57:03,889 INFO  L131       PetriNetUnfolder]: For 3755/3789 co-relation queries the response was YES.
[2023-10-25 14:57:03,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 901 events. 322/901 cut-off events. For 3755/3789 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5583 event pairs, 11 based on Foata normal form. 16/905 useless extension candidates. Maximal degree in co-relation 4536. Up to 295 conditions per place. 
[2023-10-25 14:57:03,895 INFO  L137   encePairwiseOnDemand]: 191/197 looper letters, 31 selfloop transitions, 12 changer transitions 3/294 dead transitions.
[2023-10-25 14:57:03,895 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 294 transitions, 2894 flow
[2023-10-25 14:57:03,896 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 14:57:03,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 14:57:03,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-10-25 14:57:03,897 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-10-25 14:57:03,898 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-10-25 14:57:03,898 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-10-25 14:57:03,898 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:03,898 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-10-25 14:57:03,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:03,901 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:03,918 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:03,918 INFO  L175             Difference]: Start difference. First operand has 131 places, 395 transitions, 3786 flow. Second operand 7 states and 770 transitions.
[2023-10-25 14:57:03,918 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 294 transitions, 2894 flow
[2023-10-25 14:57:03,950 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 294 transitions, 2722 flow, removed 63 selfloop flow, removed 8 redundant places.
[2023-10-25 14:57:03,953 INFO  L231             Difference]: Finished difference. Result has 117 places, 286 transitions, 2600 flow
[2023-10-25 14:57:03,960 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=117, PETRI_TRANSITIONS=286}
[2023-10-25 14:57:03,960 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 58 predicate places.
[2023-10-25 14:57:03,961 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 286 transitions, 2600 flow
[2023-10-25 14:57:03,961 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:03,961 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:03,961 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:03,974 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:04,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:04,165 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:57:04,166 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:04,166 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139930529, now seen corresponding path program 1 times
[2023-10-25 14:57:04,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:04,167 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046003002]
[2023-10-25 14:57:04,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:04,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:04,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:04,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:04,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:04,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046003002]
[2023-10-25 14:57:04,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046003002] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:04,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875255407]
[2023-10-25 14:57:04,675 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:04,675 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:04,676 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:04,690 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:04,729 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-25 14:57:04,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:04,853 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 14:57:04,856 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:04,870 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:57:04,964 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:57:05,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:05,057 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:05,057 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:57:05,117 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:05,117 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:57:05,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:05,198 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:05,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:05,206 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:05,223 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false
[2023-10-25 14:57:05,255 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:57:05,270 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:57:05,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:05,410 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875255407] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:05,410 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:05,410 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 14:57:05,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808341547]
[2023-10-25 14:57:05,411 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:05,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 14:57:05,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:05,412 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 14:57:05,412 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-25 14:57:05,455 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2023-10-25 14:57:05,456 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 286 transitions, 2600 flow. Second operand  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:05,456 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:05,456 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2023-10-25 14:57:05,456 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:07,947 INFO  L130       PetriNetUnfolder]: 532/1249 cut-off events.
[2023-10-25 14:57:07,947 INFO  L131       PetriNetUnfolder]: For 5011/5011 co-relation queries the response was YES.
[2023-10-25 14:57:07,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 1249 events. 532/1249 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7590 event pairs, 30 based on Foata normal form. 43/1292 useless extension candidates. Maximal degree in co-relation 6640. Up to 666 conditions per place. 
[2023-10-25 14:57:07,972 INFO  L137   encePairwiseOnDemand]: 160/197 looper letters, 276 selfloop transitions, 203 changer transitions 6/487 dead transitions.
[2023-10-25 14:57:07,985 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 487 transitions, 5040 flow
[2023-10-25 14:57:07,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-10-25 14:57:07,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-10-25 14:57:07,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1342 transitions.
[2023-10-25 14:57:07,993 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34060913705583756
[2023-10-25 14:57:07,993 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1342 transitions.
[2023-10-25 14:57:07,993 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1342 transitions.
[2023-10-25 14:57:07,994 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:07,994 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1342 transitions.
[2023-10-25 14:57:07,996 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.1) internal successors, (1342), 20 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:08,000 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:08,001 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:08,012 INFO  L175             Difference]: Start difference. First operand has 117 places, 286 transitions, 2600 flow. Second operand 20 states and 1342 transitions.
[2023-10-25 14:57:08,012 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 487 transitions, 5040 flow
[2023-10-25 14:57:08,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 487 transitions, 5016 flow, removed 6 selfloop flow, removed 4 redundant places.
[2023-10-25 14:57:08,066 INFO  L231             Difference]: Finished difference. Result has 137 places, 364 transitions, 4084 flow
[2023-10-25 14:57:08,066 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4084, PETRI_PLACES=137, PETRI_TRANSITIONS=364}
[2023-10-25 14:57:08,068 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 78 predicate places.
[2023-10-25 14:57:08,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 364 transitions, 4084 flow
[2023-10-25 14:57:08,069 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:08,069 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:08,069 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:08,089 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:08,272 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:08,273 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:57:08,274 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:08,274 INFO  L85        PathProgramCache]: Analyzing trace with hash -920454980, now seen corresponding path program 1 times
[2023-10-25 14:57:08,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:08,274 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14750845]
[2023-10-25 14:57:08,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:08,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:08,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:08,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:08,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:08,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14750845]
[2023-10-25 14:57:08,795 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14750845] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:08,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655938040]
[2023-10-25 14:57:08,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:08,795 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:08,795 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:08,798 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:08,853 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-25 14:57:08,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:08,960 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 14:57:08,963 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:08,985 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:57:09,094 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:57:09,133 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,134 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:09,169 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,170 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,172 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:57:09,238 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,240 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,240 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:57:09,327 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:09,328 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:09,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:09,369 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:09,404 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2023-10-25 14:57:09,439 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))) is different from false
[2023-10-25 14:57:09,822 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))))) is different from false
[2023-10-25 14:57:10,071 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:10,072 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2023-10-25 14:57:10,077 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:10,077 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2023-10-25 14:57:10,080 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2023-10-25 14:57:10,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:10,197 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655938040] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:10,198 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:10,198 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-25 14:57:10,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429564868]
[2023-10-25 14:57:10,198 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:10,198 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-25 14:57:10,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:10,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-25 14:57:10,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=520, Unknown=17, NotChecked=150, Total=812
[2023-10-25 14:57:10,325 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2023-10-25 14:57:10,327 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 364 transitions, 4084 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:10,327 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:10,327 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2023-10-25 14:57:10,327 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:11,292 INFO  L130       PetriNetUnfolder]: 506/1193 cut-off events.
[2023-10-25 14:57:11,305 INFO  L131       PetriNetUnfolder]: For 8524/8531 co-relation queries the response was YES.
[2023-10-25 14:57:11,310 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 1193 events. 506/1193 cut-off events. For 8524/8531 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7068 event pairs, 48 based on Foata normal form. 29/1221 useless extension candidates. Maximal degree in co-relation 7689. Up to 1103 conditions per place. 
[2023-10-25 14:57:11,315 INFO  L137   encePairwiseOnDemand]: 188/197 looper letters, 365 selfloop transitions, 13 changer transitions 1/381 dead transitions.
[2023-10-25 14:57:11,315 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 381 transitions, 4949 flow
[2023-10-25 14:57:11,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-10-25 14:57:11,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-10-25 14:57:11,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-10-25 14:57:11,318 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32639593908629444
[2023-10-25 14:57:11,318 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-10-25 14:57:11,318 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-10-25 14:57:11,319 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:11,319 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-10-25 14:57:11,320 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:11,331 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:11,332 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:11,332 INFO  L175             Difference]: Start difference. First operand has 137 places, 364 transitions, 4084 flow. Second operand 10 states and 643 transitions.
[2023-10-25 14:57:11,332 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 381 transitions, 4949 flow
[2023-10-25 14:57:11,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 381 transitions, 4786 flow, removed 42 selfloop flow, removed 12 redundant places.
[2023-10-25 14:57:11,411 INFO  L231             Difference]: Finished difference. Result has 133 places, 349 transitions, 3800 flow
[2023-10-25 14:57:11,412 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3800, PETRI_PLACES=133, PETRI_TRANSITIONS=349}
[2023-10-25 14:57:11,412 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-10-25 14:57:11,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 349 transitions, 3800 flow
[2023-10-25 14:57:11,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:11,413 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:11,413 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:11,432 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-10-25 14:57:11,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:11,618 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:57:11,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:11,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 819311960, now seen corresponding path program 2 times
[2023-10-25 14:57:11,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:11,619 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498733148]
[2023-10-25 14:57:11,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:11,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:11,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:12,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:12,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:12,435 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498733148]
[2023-10-25 14:57:12,435 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498733148] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:12,435 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958567372]
[2023-10-25 14:57:12,435 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 14:57:12,435 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:12,435 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:12,442 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:12,492 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-25 14:57:12,629 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 14:57:12,629 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:57:12,643 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-25 14:57:12,647 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:12,695 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-10-25 14:57:12,701 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-25 14:57:12,899 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:57:12,957 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:12,957 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:13,009 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,010 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:57:13,067 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2023-10-25 14:57:13,095 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,096 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,096 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,097 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:57:13,162 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,163 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:13,183 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,183 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:13,205 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:13,295 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:13,296 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:13,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:13,340 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:13,357 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-25 14:57:13,393 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-10-25 14:57:13,431 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:57:13,459 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 14:57:13,482 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:57:13,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-10-25 14:57:13,627 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958567372] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:13,627 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:13,627 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26
[2023-10-25 14:57:13,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075882703]
[2023-10-25 14:57:13,629 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:13,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-25 14:57:13,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:13,630 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-25 14:57:13,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-10-25 14:57:13,632 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 197
[2023-10-25 14:57:13,633 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 349 transitions, 3800 flow. Second operand  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:13,633 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:13,633 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 197
[2023-10-25 14:57:13,633 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:15,797 INFO  L130       PetriNetUnfolder]: 499/1175 cut-off events.
[2023-10-25 14:57:15,797 INFO  L131       PetriNetUnfolder]: For 7545/7552 co-relation queries the response was YES.
[2023-10-25 14:57:15,801 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 1175 events. 499/1175 cut-off events. For 7545/7552 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6971 event pairs, 21 based on Foata normal form. 22/1196 useless extension candidates. Maximal degree in co-relation 7438. Up to 399 conditions per place. 
[2023-10-25 14:57:15,812 INFO  L137   encePairwiseOnDemand]: 162/197 looper letters, 280 selfloop transitions, 219 changer transitions 6/507 dead transitions.
[2023-10-25 14:57:15,812 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 507 transitions, 6268 flow
[2023-10-25 14:57:15,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 14:57:15,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 14:57:15,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1166 transitions.
[2023-10-25 14:57:15,819 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3115148276783329
[2023-10-25 14:57:15,820 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1166 transitions.
[2023-10-25 14:57:15,820 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1166 transitions.
[2023-10-25 14:57:15,835 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:15,835 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1166 transitions.
[2023-10-25 14:57:15,838 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 61.36842105263158) internal successors, (1166), 19 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:15,854 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:15,855 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:15,855 INFO  L175             Difference]: Start difference. First operand has 133 places, 349 transitions, 3800 flow. Second operand 19 states and 1166 transitions.
[2023-10-25 14:57:15,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 507 transitions, 6268 flow
[2023-10-25 14:57:15,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 507 transitions, 6250 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-10-25 14:57:15,929 INFO  L231             Difference]: Finished difference. Result has 147 places, 364 transitions, 4621 flow
[2023-10-25 14:57:15,935 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4621, PETRI_PLACES=147, PETRI_TRANSITIONS=364}
[2023-10-25 14:57:15,936 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places.
[2023-10-25 14:57:15,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 364 transitions, 4621 flow
[2023-10-25 14:57:15,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:15,936 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:15,936 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 14:57:15,945 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:16,141 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-25 14:57:16,142 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-25 14:57:16,143 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:16,143 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870719176, now seen corresponding path program 1 times
[2023-10-25 14:57:16,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:16,144 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161312549]
[2023-10-25 14:57:16,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:16,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:16,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:57:16,206 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 14:57:16,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 14:57:16,282 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 14:57:16,282 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 14:57:16,283 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-10-25 14:57:16,284 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-25 14:57:16,284 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-25 14:57:16,284 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-25 14:57:16,285 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-25 14:57:16,285 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-10-25 14:57:16,285 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-25 14:57:16,285 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-25 14:57:16,285 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-25 14:57:16,286 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 14:57:16,287 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:16,289 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 14:57:16,289 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 14:57:16,336 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 14:57:16,338 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-25 14:57:16,373 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-25 14:57:16,374 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 14:57:16,374 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-25 14:57:16,374 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-10-25 14:57:16,375 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-10-25 14:57:16,375 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 14:57:16,376 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-25 14:57:16,376 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-10-25 14:57:16,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-10-25 14:57:16,395 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-10-25 14:57:16,404 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 14:57:16,405 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-10-25 14:57:16,424 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-10-25 14:57:19,138 INFO  L134        LiptonReduction]: Checked pairs total: 23932
[2023-10-25 14:57:19,138 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-10-25 14:57:19,139 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 14:57:19,139 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66cd24a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 14:57:19,139 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-10-25 14:57:19,140 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-10-25 14:57:19,140 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 14:57:19,140 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:19,140 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:19,141 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:19,141 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:19,141 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725264381, now seen corresponding path program 1 times
[2023-10-25 14:57:19,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:19,153 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184655960]
[2023-10-25 14:57:19,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:19,153 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:19,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:19,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:19,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:19,333 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184655960]
[2023-10-25 14:57:19,333 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184655960] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:57:19,334 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:57:19,334 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:57:19,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833916631]
[2023-10-25 14:57:19,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:57:19,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:57:19,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:19,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:57:19,335 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:57:19,618 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-10-25 14:57:19,619 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:19,619 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:19,619 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-10-25 14:57:19,619 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:20,637 INFO  L130       PetriNetUnfolder]: 2858/5896 cut-off events.
[2023-10-25 14:57:20,637 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-10-25 14:57:20,647 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 5896 events. 2858/5896 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 40990 event pairs, 819 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 5173. Up to 3444 conditions per place. 
[2023-10-25 14:57:20,660 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 69 selfloop transitions, 42 changer transitions 0/142 dead transitions.
[2023-10-25 14:57:20,660 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 532 flow
[2023-10-25 14:57:20,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:57:20,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:57:20,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2023-10-25 14:57:20,662 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5890937019969278
[2023-10-25 14:57:20,662 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2023-10-25 14:57:20,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2023-10-25 14:57:20,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:20,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2023-10-25 14:57:20,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:20,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:20,691 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:20,692 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 767 transitions.
[2023-10-25 14:57:20,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 532 flow
[2023-10-25 14:57:20,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:57:20,694 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-10-25 14:57:20,694 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2023-10-25 14:57:20,694 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-10-25 14:57:20,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-10-25 14:57:20,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:20,695 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:20,695 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:20,695 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 14:57:20,695 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:20,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:20,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -329715416, now seen corresponding path program 1 times
[2023-10-25 14:57:20,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:20,696 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013008298]
[2023-10-25 14:57:20,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:20,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:20,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:20,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:20,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:20,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013008298]
[2023-10-25 14:57:20,744 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013008298] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:57:20,744 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:57:20,744 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 14:57:20,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711844537]
[2023-10-25 14:57:20,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:57:20,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 14:57:20,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:20,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 14:57:20,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 14:57:20,808 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 217
[2023-10-25 14:57:20,809 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:20,809 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:20,809 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 217
[2023-10-25 14:57:20,809 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:21,398 INFO  L130       PetriNetUnfolder]: 1510/4077 cut-off events.
[2023-10-25 14:57:21,399 INFO  L131       PetriNetUnfolder]: For 1360/1548 co-relation queries the response was YES.
[2023-10-25 14:57:21,404 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8852 conditions, 4077 events. 1510/4077 cut-off events. For 1360/1548 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 31624 event pairs, 527 based on Foata normal form. 0/3748 useless extension candidates. Maximal degree in co-relation 3838. Up to 1446 conditions per place. 
[2023-10-25 14:57:21,438 INFO  L137   encePairwiseOnDemand]: 213/217 looper letters, 37 selfloop transitions, 3 changer transitions 2/121 dead transitions.
[2023-10-25 14:57:21,439 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 562 flow
[2023-10-25 14:57:21,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 14:57:21,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 14:57:21,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions.
[2023-10-25 14:57:21,440 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.618663594470046
[2023-10-25 14:57:21,440 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 537 transitions.
[2023-10-25 14:57:21,440 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions.
[2023-10-25 14:57:21,441 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:21,441 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions.
[2023-10-25 14:57:21,441 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:21,442 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:21,443 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:21,443 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 537 transitions.
[2023-10-25 14:57:21,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 562 flow
[2023-10-25 14:57:21,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 14:57:21,447 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-10-25 14:57:21,461 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2023-10-25 14:57:21,462 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-10-25 14:57:21,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-10-25 14:57:21,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:21,462 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:21,462 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:21,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 14:57:21,463 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:21,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:21,463 INFO  L85        PathProgramCache]: Analyzing trace with hash 580316733, now seen corresponding path program 1 times
[2023-10-25 14:57:21,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:21,463 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89235334]
[2023-10-25 14:57:21,463 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:21,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:21,469 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:21,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:21,743 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:21,743 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89235334]
[2023-10-25 14:57:21,743 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89235334] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:57:21,744 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:57:21,744 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:57:21,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470421485]
[2023-10-25 14:57:21,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:57:21,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:57:21,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:21,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:57:21,747 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:57:22,112 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 217
[2023-10-25 14:57:22,113 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:22,113 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:22,113 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 217
[2023-10-25 14:57:22,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:23,683 INFO  L130       PetriNetUnfolder]: 6215/11785 cut-off events.
[2023-10-25 14:57:23,684 INFO  L131       PetriNetUnfolder]: For 6036/6204 co-relation queries the response was YES.
[2023-10-25 14:57:23,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30089 conditions, 11785 events. 6215/11785 cut-off events. For 6036/6204 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 86479 event pairs, 1278 based on Foata normal form. 19/11441 useless extension candidates. Maximal degree in co-relation 29960. Up to 6839 conditions per place. 
[2023-10-25 14:57:23,780 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 116 selfloop transitions, 104 changer transitions 1/253 dead transitions.
[2023-10-25 14:57:23,780 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 253 transitions, 1504 flow
[2023-10-25 14:57:23,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:57:23,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:57:23,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions.
[2023-10-25 14:57:23,781 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752688172043011
[2023-10-25 14:57:23,781 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 749 transitions.
[2023-10-25 14:57:23,782 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions.
[2023-10-25 14:57:23,782 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:23,782 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions.
[2023-10-25 14:57:23,783 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:23,793 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:23,810 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:23,810 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 749 transitions.
[2023-10-25 14:57:23,810 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 253 transitions, 1504 flow
[2023-10-25 14:57:23,819 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 253 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 14:57:23,835 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-10-25 14:57:23,836 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2023-10-25 14:57:23,837 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-10-25 14:57:23,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-10-25 14:57:23,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:23,837 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:23,837 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:23,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 14:57:23,838 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:23,838 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:23,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 747515608, now seen corresponding path program 1 times
[2023-10-25 14:57:23,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:23,838 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904882661]
[2023-10-25 14:57:23,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:23,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:23,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:24,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:24,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:24,087 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904882661]
[2023-10-25 14:57:24,087 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904882661] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:57:24,087 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:57:24,087 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:57:24,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194723774]
[2023-10-25 14:57:24,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:57:24,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:57:24,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:24,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:57:24,102 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:57:24,260 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217
[2023-10-25 14:57:24,260 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:24,260 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:24,260 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217
[2023-10-25 14:57:24,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:27,100 INFO  L130       PetriNetUnfolder]: 10728/18665 cut-off events.
[2023-10-25 14:57:27,101 INFO  L131       PetriNetUnfolder]: For 23070/23295 co-relation queries the response was YES.
[2023-10-25 14:57:27,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63188 conditions, 18665 events. 10728/18665 cut-off events. For 23070/23295 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 132578 event pairs, 3389 based on Foata normal form. 4/17840 useless extension candidates. Maximal degree in co-relation 44831. Up to 15062 conditions per place. 
[2023-10-25 14:57:27,245 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 241 selfloop transitions, 178 changer transitions 0/437 dead transitions.
[2023-10-25 14:57:27,258 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 437 transitions, 3398 flow
[2023-10-25 14:57:27,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:57:27,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:57:27,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions.
[2023-10-25 14:57:27,260 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105990783410138
[2023-10-25 14:57:27,261 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 795 transitions.
[2023-10-25 14:57:27,261 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions.
[2023-10-25 14:57:27,263 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:27,263 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions.
[2023-10-25 14:57:27,264 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:27,265 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:27,265 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:27,265 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 795 transitions.
[2023-10-25 14:57:27,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 437 transitions, 3398 flow
[2023-10-25 14:57:27,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 437 transitions, 3388 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-25 14:57:27,380 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-10-25 14:57:27,380 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2023-10-25 14:57:27,381 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-10-25 14:57:27,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-10-25 14:57:27,381 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:27,381 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:27,382 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:27,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 14:57:27,382 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:27,382 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:27,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 102692192, now seen corresponding path program 1 times
[2023-10-25 14:57:27,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:27,383 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588429358]
[2023-10-25 14:57:27,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:27,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:27,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:27,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:27,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:27,784 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588429358]
[2023-10-25 14:57:27,784 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588429358] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:27,784 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957741889]
[2023-10-25 14:57:27,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:27,784 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:27,784 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:27,798 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:27,837 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-25 14:57:27,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:27,986 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 14:57:27,991 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:28,002 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:57:28,082 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:57:28,105 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:28,143 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:28,144 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:57:28,194 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:28,195 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:57:28,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:28,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:28,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:28,251 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:28,282 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-25 14:57:28,293 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2023-10-25 14:57:28,305 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-25 14:57:28,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 14:57:28,438 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957741889] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:28,438 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:28,439 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 14:57:28,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344028759]
[2023-10-25 14:57:28,439 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:28,439 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 14:57:28,439 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:28,439 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 14:57:28,439 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-10-25 14:57:28,481 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 217
[2023-10-25 14:57:28,482 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:28,482 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:28,482 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 217
[2023-10-25 14:57:28,482 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:34,167 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2023-10-25 14:57:34,167 INFO  L131       PetriNetUnfolder]: For 50811/50817 co-relation queries the response was YES.
[2023-10-25 14:57:34,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50811/50817 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 187796 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2023-10-25 14:57:34,352 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2023-10-25 14:57:34,352 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2023-10-25 14:57:34,352 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-25 14:57:34,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-25 14:57:34,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2023-10-25 14:57:34,369 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4001536098310292
[2023-10-25 14:57:34,369 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2023-10-25 14:57:34,370 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2023-10-25 14:57:34,370 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:34,370 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2023-10-25 14:57:34,374 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:34,383 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:34,384 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:34,384 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2023-10-25 14:57:34,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2023-10-25 14:57:35,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2023-10-25 14:57:35,060 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2023-10-25 14:57:35,061 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2023-10-25 14:57:35,061 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2023-10-25 14:57:35,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2023-10-25 14:57:35,062 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:35,062 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:35,062 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:35,068 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:35,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-25 14:57:35,267 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:35,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:35,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170144666, now seen corresponding path program 1 times
[2023-10-25 14:57:35,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:35,268 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614683283]
[2023-10-25 14:57:35,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:35,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:35,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:35,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:35,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:35,745 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614683283]
[2023-10-25 14:57:35,745 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614683283] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:35,746 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887620279]
[2023-10-25 14:57:35,746 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:35,746 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:35,746 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:35,762 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:35,794 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-25 14:57:35,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:35,962 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 14:57:35,964 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:35,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:57:36,101 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:57:36,138 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:36,183 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:57:36,241 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,242 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:57:36,298 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:36,299 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:36,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:36,339 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:36,630 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2023-10-25 14:57:36,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 14:57:36,745 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887620279] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:36,745 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:36,746 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-10-25 14:57:36,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162258118]
[2023-10-25 14:57:36,746 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:36,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-25 14:57:36,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:36,746 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-25 14:57:36,746 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=520, Unknown=23, NotChecked=48, Total=702
[2023-10-25 14:57:36,871 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 217
[2023-10-25 14:57:36,872 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:36,872 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:36,872 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 217
[2023-10-25 14:57:36,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:43,626 INFO  L130       PetriNetUnfolder]: 19305/31847 cut-off events.
[2023-10-25 14:57:43,626 INFO  L131       PetriNetUnfolder]: For 113899/113899 co-relation queries the response was YES.
[2023-10-25 14:57:43,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154854 conditions, 31847 events. 19305/31847 cut-off events. For 113899/113899 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 228008 event pairs, 2748 based on Foata normal form. 230/29258 useless extension candidates. Maximal degree in co-relation 134937. Up to 15974 conditions per place. 
[2023-10-25 14:57:43,929 INFO  L137   encePairwiseOnDemand]: 187/217 looper letters, 841 selfloop transitions, 489 changer transitions 0/1333 dead transitions.
[2023-10-25 14:57:43,929 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1333 transitions, 15562 flow
[2023-10-25 14:57:43,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-10-25 14:57:43,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-10-25 14:57:43,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-10-25 14:57:43,952 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3980414746543779
[2023-10-25 14:57:43,952 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-10-25 14:57:43,952 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-10-25 14:57:43,952 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:43,952 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-10-25 14:57:43,954 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:43,956 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:43,957 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:43,957 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 16 states and 1382 transitions.
[2023-10-25 14:57:43,957 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1333 transitions, 15562 flow
[2023-10-25 14:57:45,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1333 transitions, 15515 flow, removed 22 selfloop flow, removed 1 redundant places.
[2023-10-25 14:57:45,745 INFO  L231             Difference]: Finished difference. Result has 154 places, 931 transitions, 11989 flow
[2023-10-25 14:57:45,746 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11989, PETRI_PLACES=154, PETRI_TRANSITIONS=931}
[2023-10-25 14:57:45,751 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 83 predicate places.
[2023-10-25 14:57:45,751 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 931 transitions, 11989 flow
[2023-10-25 14:57:45,752 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:45,752 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:57:45,752 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:57:45,758 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-25 14:57:45,956 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-25 14:57:45,957 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:57:45,968 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:57:45,968 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669689062, now seen corresponding path program 1 times
[2023-10-25 14:57:45,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:57:45,969 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332768127]
[2023-10-25 14:57:45,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:45,969 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:57:45,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:46,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:46,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:57:46,364 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332768127]
[2023-10-25 14:57:46,364 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332768127] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:57:46,364 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782877]
[2023-10-25 14:57:46,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:57:46,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:57:46,365 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:57:46,366 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:57:46,391 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-25 14:57:46,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:57:46,524 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-10-25 14:57:46,536 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:57:46,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:57:46,640 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:57:46,676 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:57:46,719 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:46,719 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:57:46,753 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:57:46,754 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:57:46,803 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:57:46,804 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:57:46,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:46,825 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:57:46,849 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-25 14:57:47,024 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-10-25 14:57:47,149 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:57:47,149 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [782877] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:57:47,149 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:57:47,149 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-10-25 14:57:47,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370995344]
[2023-10-25 14:57:47,149 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:57:47,149 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 14:57:47,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:57:47,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 14:57:47,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=446, Unknown=12, NotChecked=90, Total=650
[2023-10-25 14:57:47,545 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-10-25 14:57:47,546 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 931 transitions, 11989 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:47,546 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:57:47,546 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-10-25 14:57:47,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:57:58,075 INFO  L130       PetriNetUnfolder]: 23371/38348 cut-off events.
[2023-10-25 14:57:58,076 INFO  L131       PetriNetUnfolder]: For 185516/185516 co-relation queries the response was YES.
[2023-10-25 14:57:58,240 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 210064 conditions, 38348 events. 23371/38348 cut-off events. For 185516/185516 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 282963 event pairs, 3764 based on Foata normal form. 0/35273 useless extension candidates. Maximal degree in co-relation 181911. Up to 26196 conditions per place. 
[2023-10-25 14:57:58,380 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 975 selfloop transitions, 621 changer transitions 1/1600 dead transitions.
[2023-10-25 14:57:58,381 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1600 transitions, 20849 flow
[2023-10-25 14:57:58,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 14:57:58,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 14:57:58,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2023-10-25 14:57:58,398 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2023-10-25 14:57:58,398 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2023-10-25 14:57:58,398 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2023-10-25 14:57:58,399 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:57:58,399 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2023-10-25 14:57:58,400 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:58,416 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:58,416 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:57:58,417 INFO  L175             Difference]: Start difference. First operand has 154 places, 931 transitions, 11989 flow. Second operand 19 states and 1627 transitions.
[2023-10-25 14:57:58,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1600 transitions, 20849 flow
[2023-10-25 14:58:01,873 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1600 transitions, 20663 flow, removed 68 selfloop flow, removed 5 redundant places.
[2023-10-25 14:58:01,893 INFO  L231             Difference]: Finished difference. Result has 172 places, 1306 transitions, 18102 flow
[2023-10-25 14:58:01,894 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=11813, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18102, PETRI_PLACES=172, PETRI_TRANSITIONS=1306}
[2023-10-25 14:58:01,894 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2023-10-25 14:58:01,894 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1306 transitions, 18102 flow
[2023-10-25 14:58:01,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:01,895 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:01,895 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:01,901 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-25 14:58:02,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-25 14:58:02,100 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:58:02,100 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:02,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 517033069, now seen corresponding path program 1 times
[2023-10-25 14:58:02,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:02,101 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671669918]
[2023-10-25 14:58:02,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:02,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:02,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:02,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:02,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:02,600 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671669918]
[2023-10-25 14:58:02,600 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671669918] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:58:02,600 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747497017]
[2023-10-25 14:58:02,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:02,600 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:02,600 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:58:02,601 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:58:02,640 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-25 14:58:02,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:02,811 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-10-25 14:58:02,813 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:58:02,842 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2023-10-25 14:58:02,961 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:58:02,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:02,997 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:58:03,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:03,042 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:03,042 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:58:03,090 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:03,091 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:03,091 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:03,093 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:58:03,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:03,188 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:58:03,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:03,216 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:58:03,234 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-10-25 14:58:03,265 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-10-25 14:58:03,333 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))))) is different from false
[2023-10-25 14:58:03,364 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39)))))) is different from false
[2023-10-25 14:58:03,400 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2023-10-25 14:58:03,431 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:03,431 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-25 14:58:03,437 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:03,437 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2023-10-25 14:58:03,439 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2023-10-25 14:58:03,447 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:58:03,447 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-25 14:58:03,452 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:58:03,452 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 14:58:03,457 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:58:03,457 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 14:58:03,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:03,548 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [747497017] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:58:03,548 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:58:03,548 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-10-25 14:58:03,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390712788]
[2023-10-25 14:58:03,548 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:58:03,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-25 14:58:03,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:03,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-25 14:58:03,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=455, Unknown=5, NotChecked=240, Total=812
[2023-10-25 14:58:03,694 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 217
[2023-10-25 14:58:03,695 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1306 transitions, 18102 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:03,695 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:03,695 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 217
[2023-10-25 14:58:03,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:16,328 INFO  L130       PetriNetUnfolder]: 27062/44967 cut-off events.
[2023-10-25 14:58:16,328 INFO  L131       PetriNetUnfolder]: For 320825/320835 co-relation queries the response was YES.
[2023-10-25 14:58:16,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 294720 conditions, 44967 events. 27062/44967 cut-off events. For 320825/320835 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 342153 event pairs, 3307 based on Foata normal form. 283/41530 useless extension candidates. Maximal degree in co-relation 256432. Up to 23187 conditions per place. 
[2023-10-25 14:58:16,728 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1188 selfloop transitions, 910 changer transitions 0/2101 dead transitions.
[2023-10-25 14:58:16,729 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2101 transitions, 32784 flow
[2023-10-25 14:58:16,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-10-25 14:58:16,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-10-25 14:58:16,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1157 transitions.
[2023-10-25 14:58:16,732 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.380842659644503
[2023-10-25 14:58:16,732 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1157 transitions.
[2023-10-25 14:58:16,732 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1157 transitions.
[2023-10-25 14:58:16,736 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:16,736 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1157 transitions.
[2023-10-25 14:58:16,737 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.64285714285714) internal successors, (1157), 14 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:16,739 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:16,740 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:16,740 INFO  L175             Difference]: Start difference. First operand has 172 places, 1306 transitions, 18102 flow. Second operand 14 states and 1157 transitions.
[2023-10-25 14:58:16,740 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2101 transitions, 32784 flow
[2023-10-25 14:58:25,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2101 transitions, 32421 flow, removed 138 selfloop flow, removed 9 redundant places.
[2023-10-25 14:58:25,352 INFO  L231             Difference]: Finished difference. Result has 183 places, 1750 transitions, 28975 flow
[2023-10-25 14:58:25,359 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=17885, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=28975, PETRI_PLACES=183, PETRI_TRANSITIONS=1750}
[2023-10-25 14:58:25,359 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 112 predicate places.
[2023-10-25 14:58:25,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 1750 transitions, 28975 flow
[2023-10-25 14:58:25,360 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:25,360 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:25,360 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:25,364 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-25 14:58:25,564 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:25,564 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:58:25,565 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:25,565 INFO  L85        PathProgramCache]: Analyzing trace with hash -785127108, now seen corresponding path program 1 times
[2023-10-25 14:58:25,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:25,565 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188578130]
[2023-10-25 14:58:25,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:25,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:25,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:25,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 14:58:25,873 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:25,874 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188578130]
[2023-10-25 14:58:25,874 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188578130] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 14:58:25,874 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 14:58:25,874 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 14:58:25,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118529384]
[2023-10-25 14:58:25,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 14:58:25,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 14:58:25,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:25,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 14:58:25,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 14:58:26,346 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217
[2023-10-25 14:58:26,346 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1750 transitions, 28975 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:26,346 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:26,347 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217
[2023-10-25 14:58:26,347 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:58:37,236 INFO  L130       PetriNetUnfolder]: 21880/39367 cut-off events.
[2023-10-25 14:58:37,237 INFO  L131       PetriNetUnfolder]: For 410800/417515 co-relation queries the response was YES.
[2023-10-25 14:58:37,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266213 conditions, 39367 events. 21880/39367 cut-off events. For 410800/417515 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 331804 event pairs, 4147 based on Foata normal form. 1101/39049 useless extension candidates. Maximal degree in co-relation 240356. Up to 24514 conditions per place. 
[2023-10-25 14:58:37,574 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 1438 selfloop transitions, 201 changer transitions 0/1965 dead transitions.
[2023-10-25 14:58:37,574 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1965 transitions, 35740 flow
[2023-10-25 14:58:37,574 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 14:58:37,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 14:58:37,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions.
[2023-10-25 14:58:37,575 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5898617511520737
[2023-10-25 14:58:37,576 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 768 transitions.
[2023-10-25 14:58:37,576 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions.
[2023-10-25 14:58:37,576 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:58:37,576 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions.
[2023-10-25 14:58:37,577 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:37,595 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:37,596 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:37,596 INFO  L175             Difference]: Start difference. First operand has 183 places, 1750 transitions, 28975 flow. Second operand 6 states and 768 transitions.
[2023-10-25 14:58:37,596 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1965 transitions, 35740 flow
[2023-10-25 14:58:42,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1965 transitions, 35658 flow, removed 0 selfloop flow, removed 6 redundant places.
[2023-10-25 14:58:42,816 INFO  L231             Difference]: Finished difference. Result has 187 places, 1938 transitions, 33051 flow
[2023-10-25 14:58:42,822 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=28893, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33051, PETRI_PLACES=187, PETRI_TRANSITIONS=1938}
[2023-10-25 14:58:42,822 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 116 predicate places.
[2023-10-25 14:58:42,822 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 1938 transitions, 33051 flow
[2023-10-25 14:58:42,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:42,822 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:58:42,823 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:58:42,823 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-25 14:58:42,823 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:58:42,823 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:58:42,833 INFO  L85        PathProgramCache]: Analyzing trace with hash -672070267, now seen corresponding path program 2 times
[2023-10-25 14:58:42,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:58:42,833 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499110852]
[2023-10-25 14:58:42,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:58:42,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:58:42,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:58:43,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:43,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:58:43,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499110852]
[2023-10-25 14:58:43,519 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499110852] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:58:43,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43518367]
[2023-10-25 14:58:43,519 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 14:58:43,519 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:58:43,519 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:58:43,525 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:58:43,562 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-25 14:58:43,804 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 14:58:43,804 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 14:58:43,806 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-10-25 14:58:43,810 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:58:43,828 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-10-25 14:58:43,956 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:58:44,006 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:58:44,065 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:44,065 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:58:44,119 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:44,119 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:58:44,170 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:44,170 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:58:44,205 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:44,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:58:44,222 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:44,222 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:58:44,236 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:44,236 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:58:44,312 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:58:44,313 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:58:44,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:58:44,320 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:58:44,350 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-25 14:58:57,294 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:58:57,326 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:58:57,373 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:57,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54
[2023-10-25 14:58:57,383 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:58:57,383 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 66
[2023-10-25 14:58:57,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24
[2023-10-25 14:58:57,395 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2023-10-25 14:58:57,423 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:58:57,423 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2023-10-25 14:58:57,429 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:58:57,430 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-25 14:58:57,437 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:58:57,437 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-10-25 14:58:57,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked.
[2023-10-25 14:58:57,530 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [43518367] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:58:57,530 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:58:57,530 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25
[2023-10-25 14:58:57,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629654699]
[2023-10-25 14:58:57,530 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:58:57,531 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-25 14:58:57,531 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:58:57,531 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-25 14:58:57,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=427, Unknown=32, NotChecked=138, Total=702
[2023-10-25 14:58:57,644 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-10-25 14:58:57,645 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1938 transitions, 33051 flow. Second operand  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:58:57,645 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:58:57,645 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-10-25 14:58:57,645 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 14:59:19,783 INFO  L130       PetriNetUnfolder]: 29687/49460 cut-off events.
[2023-10-25 14:59:19,783 INFO  L131       PetriNetUnfolder]: For 506468/506486 co-relation queries the response was YES.
[2023-10-25 14:59:20,058 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 362783 conditions, 49460 events. 29687/49460 cut-off events. For 506468/506486 co-relation queries the response was YES. Maximal size of possible extension queue 1367. Compared 383173 event pairs, 4267 based on Foata normal form. 12/46050 useless extension candidates. Maximal degree in co-relation 329754. Up to 26295 conditions per place. 
[2023-10-25 14:59:20,282 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 1319 selfloop transitions, 1599 changer transitions 1/2923 dead transitions.
[2023-10-25 14:59:20,282 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 2923 transitions, 51033 flow
[2023-10-25 14:59:20,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 14:59:20,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 14:59:20,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2023-10-25 14:59:20,307 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2023-10-25 14:59:20,307 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2023-10-25 14:59:20,307 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2023-10-25 14:59:20,308 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 14:59:20,308 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2023-10-25 14:59:20,310 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:59:20,313 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:59:20,313 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:59:20,313 INFO  L175             Difference]: Start difference. First operand has 187 places, 1938 transitions, 33051 flow. Second operand 19 states and 1627 transitions.
[2023-10-25 14:59:20,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 2923 transitions, 51033 flow
[2023-10-25 14:59:32,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 2923 transitions, 50739 flow, removed 147 selfloop flow, removed 0 redundant places.
[2023-10-25 14:59:32,233 INFO  L231             Difference]: Finished difference. Result has 211 places, 2442 transitions, 46474 flow
[2023-10-25 14:59:32,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=32763, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=46474, PETRI_PLACES=211, PETRI_TRANSITIONS=2442}
[2023-10-25 14:59:32,235 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 140 predicate places.
[2023-10-25 14:59:32,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 2442 transitions, 46474 flow
[2023-10-25 14:59:32,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:59:32,235 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 14:59:32,235 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 14:59:32,241 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-25 14:59:32,440 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:59:32,440 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 14:59:32,441 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 14:59:32,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -72607429, now seen corresponding path program 1 times
[2023-10-25 14:59:32,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 14:59:32,441 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728292371]
[2023-10-25 14:59:32,442 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:59:32,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 14:59:32,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:59:33,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:59:33,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 14:59:33,247 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728292371]
[2023-10-25 14:59:33,247 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728292371] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 14:59:33,247 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369687121]
[2023-10-25 14:59:33,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 14:59:33,247 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 14:59:33,247 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 14:59:33,248 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 14:59:33,298 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-25 14:59:33,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 14:59:33,486 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core
[2023-10-25 14:59:33,490 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 14:59:33,499 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:33,501 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 14:59:33,503 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2023-10-25 14:59:33,970 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:59:33,970 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-10-25 14:59:34,101 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 14:59:34,101 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-10-25 14:59:34,259 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-10-25 14:59:34,260 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2023-10-25 14:59:34,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 14:59:34,300 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 14:59:34,313 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:59:34,313 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 14:59:34,340 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:59:34,341 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 14:59:34,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 14:59:34,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:59:34,361 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 14:59:34,694 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-10-25 14:59:34,711 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 14:59:34,752 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:59:34,752 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2023-10-25 14:59:34,760 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 14:59:34,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 32
[2023-10-25 14:59:34,768 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:59:34,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 14:59:34,773 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:59:34,773 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2023-10-25 14:59:34,778 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 14:59:34,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2023-10-25 14:59:34,837 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-25 14:59:34,842 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1748) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2023-10-25 14:59:34,886 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_70| Int)) (or (forall ((v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_70| v_ArrVal_1748) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_70| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2023-10-25 14:59:35,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 14:59:35,028 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369687121] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 14:59:35,028 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 14:59:35,028 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 27
[2023-10-25 14:59:35,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119700189]
[2023-10-25 14:59:35,028 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 14:59:35,029 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-10-25 14:59:35,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 14:59:35,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-10-25 14:59:35,029 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=442, Unknown=42, NotChecked=240, Total=812
[2023-10-25 14:59:35,293 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 217
[2023-10-25 14:59:35,294 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 2442 transitions, 46474 flow. Second operand  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 14:59:35,294 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 14:59:35,294 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 217
[2023-10-25 14:59:35,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:00:09,094 INFO  L130       PetriNetUnfolder]: 40673/67072 cut-off events.
[2023-10-25 15:00:09,095 INFO  L131       PetriNetUnfolder]: For 935943/935943 co-relation queries the response was YES.
[2023-10-25 15:00:09,528 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 554640 conditions, 67072 events. 40673/67072 cut-off events. For 935943/935943 co-relation queries the response was YES. Maximal size of possible extension queue 1709. Compared 528517 event pairs, 5442 based on Foata normal form. 0/62747 useless extension candidates. Maximal degree in co-relation 501997. Up to 50070 conditions per place. 
[2023-10-25 15:00:09,886 INFO  L137   encePairwiseOnDemand]: 186/217 looper letters, 3800 selfloop transitions, 565 changer transitions 4/4370 dead transitions.
[2023-10-25 15:00:09,886 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 4370 transitions, 85437 flow
[2023-10-25 15:00:09,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-25 15:00:09,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-25 15:00:09,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1833 transitions.
[2023-10-25 15:00:09,890 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3519585253456221
[2023-10-25 15:00:09,891 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1833 transitions.
[2023-10-25 15:00:09,891 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1833 transitions.
[2023-10-25 15:00:09,891 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:00:09,891 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1833 transitions.
[2023-10-25 15:00:09,893 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 76.375) internal successors, (1833), 24 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:00:09,897 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 217.0) internal successors, (5425), 25 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:00:09,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 217.0) internal successors, (5425), 25 states have internal predecessors, (5425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:00:09,914 INFO  L175             Difference]: Start difference. First operand has 211 places, 2442 transitions, 46474 flow. Second operand 24 states and 1833 transitions.
[2023-10-25 15:00:09,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 4370 transitions, 85437 flow
[2023-10-25 15:00:47,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 4370 transitions, 84317 flow, removed 483 selfloop flow, removed 11 redundant places.
[2023-10-25 15:00:47,340 INFO  L231             Difference]: Finished difference. Result has 239 places, 3038 transitions, 59415 flow
[2023-10-25 15:00:47,343 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=45796, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=59415, PETRI_PLACES=239, PETRI_TRANSITIONS=3038}
[2023-10-25 15:00:47,357 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 168 predicate places.
[2023-10-25 15:00:47,358 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 3038 transitions, 59415 flow
[2023-10-25 15:00:47,358 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:00:47,358 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:00:47,358 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:00:47,366 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-25 15:00:47,564 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-25 15:00:47,565 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:00:47,565 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:00:47,565 INFO  L85        PathProgramCache]: Analyzing trace with hash -824079329, now seen corresponding path program 2 times
[2023-10-25 15:00:47,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:00:47,566 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955246231]
[2023-10-25 15:00:47,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:00:47,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:00:47,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:00:48,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:00:48,332 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:00:48,332 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955246231]
[2023-10-25 15:00:48,332 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955246231] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:00:48,333 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576775309]
[2023-10-25 15:00:48,333 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:00:48,333 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:00:48,333 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:00:48,350 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:00:48,385 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-25 15:00:48,656 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:00:48,656 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:00:48,658 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2023-10-25 15:00:48,661 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:00:48,677 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97
[2023-10-25 15:00:49,278 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-10-25 15:00:49,279 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59
[2023-10-25 15:00:49,293 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,295 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,319 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-10-25 15:00:49,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 43
[2023-10-25 15:00:49,334 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:00:49,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-25 15:00:49,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-25 15:00:49,614 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-25 15:00:49,776 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:00:49,842 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,843 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:00:49,896 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,897 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,899 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:00:49,957 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,958 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,958 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:49,959 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:00:50,040 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:50,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:50,042 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:00:50,043 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2023-10-25 15:00:50,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:00:50,096 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:00:52,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:00:52,173 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576775309] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:00:52,173 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:00:52,173 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-10-25 15:00:52,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870158062]
[2023-10-25 15:00:52,173 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:00:52,174 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-10-25 15:00:52,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:00:52,174 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-10-25 15:00:52,174 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1346, Unknown=13, NotChecked=0, Total=1560
[2023-10-25 15:00:53,179 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 217
[2023-10-25 15:00:53,180 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 3038 transitions, 59415 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:00:53,180 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:00:53,180 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 217
[2023-10-25 15:00:53,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:01:39,100 INFO  L130       PetriNetUnfolder]: 47284/77758 cut-off events.
[2023-10-25 15:01:39,101 INFO  L131       PetriNetUnfolder]: For 1485724/1485724 co-relation queries the response was YES.
[2023-10-25 15:01:39,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 699726 conditions, 77758 events. 47284/77758 cut-off events. For 1485724/1485724 co-relation queries the response was YES. Maximal size of possible extension queue 2087. Compared 631062 event pairs, 10307 based on Foata normal form. 262/74758 useless extension candidates. Maximal degree in co-relation 635198. Up to 65480 conditions per place. 
[2023-10-25 15:01:40,339 INFO  L137   encePairwiseOnDemand]: 189/217 looper letters, 3586 selfloop transitions, 520 changer transitions 8/4115 dead transitions.
[2023-10-25 15:01:40,339 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 4115 transitions, 87406 flow
[2023-10-25 15:01:40,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-25 15:01:40,340 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-25 15:01:40,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1454 transitions.
[2023-10-25 15:01:40,347 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2913243838910038
[2023-10-25 15:01:40,348 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1454 transitions.
[2023-10-25 15:01:40,348 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1454 transitions.
[2023-10-25 15:01:40,349 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:01:40,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1454 transitions.
[2023-10-25 15:01:40,354 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 63.21739130434783) internal successors, (1454), 23 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:01:40,359 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:01:40,359 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:01:40,359 INFO  L175             Difference]: Start difference. First operand has 239 places, 3038 transitions, 59415 flow. Second operand 23 states and 1454 transitions.
[2023-10-25 15:01:40,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 4115 transitions, 87406 flow
[2023-10-25 15:02:41,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 4115 transitions, 86832 flow, removed 284 selfloop flow, removed 3 redundant places.
[2023-10-25 15:02:41,481 INFO  L231             Difference]: Finished difference. Result has 271 places, 3605 transitions, 73906 flow
[2023-10-25 15:02:41,484 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=58865, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=73906, PETRI_PLACES=271, PETRI_TRANSITIONS=3605}
[2023-10-25 15:02:41,484 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 200 predicate places.
[2023-10-25 15:02:41,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 271 places, 3605 transitions, 73906 flow
[2023-10-25 15:02:41,485 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:02:41,485 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:02:41,485 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:02:41,491 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-25 15:02:41,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-10-25 15:02:41,690 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:02:41,691 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:02:41,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 100292573, now seen corresponding path program 3 times
[2023-10-25 15:02:41,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:02:41,691 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633166316]
[2023-10-25 15:02:41,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:02:41,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:02:41,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:02:42,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:02:42,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:02:42,548 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633166316]
[2023-10-25 15:02:42,548 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633166316] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:02:42,548 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928149431]
[2023-10-25 15:02:42,548 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 15:02:42,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:02:42,548 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:02:42,549 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:02:42,574 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-25 15:02:42,741 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 15:02:42,741 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:02:42,743 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 69 conjunts are in the unsatisfiable core
[2023-10-25 15:02:42,746 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:02:42,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:42,770 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:42,773 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-25 15:02:42,845 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-25 15:02:43,353 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:02:43,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2023-10-25 15:02:43,505 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:02:43,505 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-10-25 15:02:43,618 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:02:43,767 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:43,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:02:43,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:43,885 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:43,887 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:02:43,887 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:02:43,980 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:02:43,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2023-10-25 15:02:44,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,043 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,044 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,044 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:02:44,104 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,104 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:02:44,133 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,133 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:02:44,161 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,161 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:02:44,180 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:02:44,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:02:44,251 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:02:44,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:02:44,291 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:02:44,310 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2034 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-25 15:02:44,365 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-25 15:02:44,432 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2023-10-25 15:02:44,474 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) .cse1 v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) .cse1 v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) .cse1 v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2034 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2033) .cse1 v_ArrVal_2034) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2023-10-25 15:02:45,197 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:02:45,197 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2023-10-25 15:02:45,203 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:02:45,203 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 82
[2023-10-25 15:02:45,212 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32
[2023-10-25 15:02:45,214 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46
[2023-10-25 15:02:45,237 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:02:45,238 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:02:45,243 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:02:45,243 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-10-25 15:02:45,258 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:02:45,258 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:02:45,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:02:45,544 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [928149431] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:02:45,544 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:02:45,544 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-10-25 15:02:45,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977253696]
[2023-10-25 15:02:45,545 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:02:45,545 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-25 15:02:45,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:02:45,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-25 15:02:45,546 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=887, Unknown=43, NotChecked=260, Total=1332
[2023-10-25 15:02:45,701 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-25 15:02:45,702 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 3605 transitions, 73906 flow. Second operand  has 37 states, 37 states have (on average 56.45945945945946) internal successors, (2089), 37 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:02:45,702 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:02:45,702 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-25 15:02:45,702 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:03:46,403 INFO  L130       PetriNetUnfolder]: 47885/78797 cut-off events.
[2023-10-25 15:03:46,404 INFO  L131       PetriNetUnfolder]: For 1663198/1663198 co-relation queries the response was YES.
[2023-10-25 15:03:47,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 730087 conditions, 78797 events. 47885/78797 cut-off events. For 1663198/1663198 co-relation queries the response was YES. Maximal size of possible extension queue 2135. Compared 638186 event pairs, 8992 based on Foata normal form. 57/75592 useless extension candidates. Maximal degree in co-relation 728532. Up to 70347 conditions per place. 
[2023-10-25 15:03:47,583 INFO  L137   encePairwiseOnDemand]: 175/217 looper letters, 4765 selfloop transitions, 868 changer transitions 117/5751 dead transitions.
[2023-10-25 15:03:47,583 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 5751 transitions, 117209 flow
[2023-10-25 15:03:47,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. 
[2023-10-25 15:03:47,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2023-10-25 15:03:47,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3648 transitions.
[2023-10-25 15:03:47,604 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3296286256438059
[2023-10-25 15:03:47,604 INFO  L72            ComplementDD]: Start complementDD. Operand 51 states and 3648 transitions.
[2023-10-25 15:03:47,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 51 states and 3648 transitions.
[2023-10-25 15:03:47,605 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:03:47,605 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3648 transitions.
[2023-10-25 15:03:47,608 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 52 states, 51 states have (on average 71.52941176470588) internal successors, (3648), 51 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:03:47,618 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 52 states, 52 states have (on average 217.0) internal successors, (11284), 52 states have internal predecessors, (11284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:03:47,619 INFO  L81            ComplementDD]: Finished complementDD. Result  has 52 states, 52 states have (on average 217.0) internal successors, (11284), 52 states have internal predecessors, (11284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:03:47,619 INFO  L175             Difference]: Start difference. First operand has 271 places, 3605 transitions, 73906 flow. Second operand 51 states and 3648 transitions.
[2023-10-25 15:03:47,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 5751 transitions, 117209 flow
[2023-10-25 15:04:56,073 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 5751 transitions, 115607 flow, removed 794 selfloop flow, removed 6 redundant places.
[2023-10-25 15:04:56,148 INFO  L231             Difference]: Finished difference. Result has 341 places, 4323 transitions, 89413 flow
[2023-10-25 15:04:56,152 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=72772, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=89413, PETRI_PLACES=341, PETRI_TRANSITIONS=4323}
[2023-10-25 15:04:56,153 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 270 predicate places.
[2023-10-25 15:04:56,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 4323 transitions, 89413 flow
[2023-10-25 15:04:56,154 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.45945945945946) internal successors, (2089), 37 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:04:56,154 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:04:56,154 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:04:56,162 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-25 15:04:56,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:04:56,360 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-10-25 15:04:56,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:04:56,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 519883715, now seen corresponding path program 4 times
[2023-10-25 15:04:56,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:04:56,362 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991867031]
[2023-10-25 15:04:56,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:04:56,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:04:56,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:04:57,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:04:57,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:04:57,179 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991867031]
[2023-10-25 15:04:57,179 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991867031] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:04:57,179 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418971815]
[2023-10-25 15:04:57,179 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 15:04:57,179 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:04:57,179 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:04:57,180 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:04:57,205 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-25 15:04:57,536 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 15:04:57,536 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:04:57,538 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2023-10-25 15:04:57,541 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:04:57,559 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:57,561 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:57,563 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2023-10-25 15:04:57,619 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2023-10-25 15:04:58,048 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:04:58,048 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-10-25 15:04:58,205 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-10-25 15:04:58,205 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-10-25 15:04:58,389 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:04:58,481 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:04:58,482 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2023-10-25 15:04:58,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:04:58,639 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,640 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,641 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:04:58,709 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,710 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,711 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,712 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:04:58,777 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:04:58,799 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,800 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:04:58,820 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,821 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:04:58,844 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:04:58,845 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:04:58,912 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:04:58,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:04:58,952 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:04:58,970 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2172 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-10-25 15:04:59,028 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-10-25 15:04:59,533 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2171 (Array Int Int)) (v_ArrVal_2172 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2171) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2172) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:04:59,759 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:04:59,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56
[2023-10-25 15:04:59,766 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:04:59,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 142
[2023-10-25 15:04:59,797 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106
[2023-10-25 15:04:59,802 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51
[2023-10-25 15:04:59,826 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:04:59,826 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:04:59,832 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:04:59,832 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:04:59,838 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-10-25 15:04:59,838 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-10-25 15:05:00,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:05:00,142 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418971815] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:05:00,142 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:05:00,142 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-10-25 15:05:00,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827075601]
[2023-10-25 15:05:00,142 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:05:00,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-10-25 15:05:00,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:05:00,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-10-25 15:05:00,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=937, Unknown=54, NotChecked=198, Total=1332
[2023-10-25 15:05:00,480 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-10-25 15:05:00,481 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 4323 transitions, 89413 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:05:00,481 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:05:00,481 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-10-25 15:05:00,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:05:11,621 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2023-10-25 15:05:15,430 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
