./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:16:01,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:16:02,058 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 22:16:02,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:16:02,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:16:02,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:16:02,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:16:02,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:16:02,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:16:02,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:16:02,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:16:02,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:16:02,094 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:16:02,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:16:02,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:16:02,096 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:16:02,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:16:02,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:16:02,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:16:02,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:16:02,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:16:02,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:16:02,100 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:16:02,100 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:16:02,101 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:16:02,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:16:02,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:16:02,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:16:02,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:16:02,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:16:02,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:16:02,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:16:02,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:16:02,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:16:02,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:16:02,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:16:02,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:16:02,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:16:02,108 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:16:02,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:16:02,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:16:02,111 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b [2023-11-21 22:16:02,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:16:02,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:16:02,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:16:02,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:16:02,388 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:16:02,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2023-11-21 22:16:05,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:16:05,899 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:16:05,899 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2023-11-21 22:16:05,919 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/data/b55220321/be6927549571418b8211afb677db3617/FLAG1d37cc86c [2023-11-21 22:16:05,935 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/data/b55220321/be6927549571418b8211afb677db3617 [2023-11-21 22:16:05,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:16:05,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:16:05,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:16:05,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:16:05,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:16:05,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:16:05" (1/1) ... [2023-11-21 22:16:05,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b0c4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:05, skipping insertion in model container [2023-11-21 22:16:05,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:16:05" (1/1) ... [2023-11-21 22:16:06,006 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:16:06,199 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:16:06,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:16:06,588 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:16:06,604 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:16:06,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:16:06,735 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:16:06,744 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:16:06,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06 WrapperNode [2023-11-21 22:16:06,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:16:06,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:16:06,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:16:06,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:16:06,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,841 INFO L138 Inliner]: procedures = 266, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2023-11-21 22:16:06,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:16:06,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:16:06,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:16:06,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:16:06,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:16:06,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:16:06,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:16:06,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:16:06,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (1/1) ... [2023-11-21 22:16:06,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:16:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:16:06,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:16:06,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:16:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:16:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:16:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:16:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 22:16:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:16:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:16:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:16:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:16:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:16:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:16:06,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:16:06,986 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:16:07,146 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:16:07,148 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:16:07,406 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:16:07,417 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:16:07,417 INFO L308 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-21 22:16:07,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:16:07 BoogieIcfgContainer [2023-11-21 22:16:07,419 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:16:07,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:16:07,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:16:07,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:16:07,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:16:05" (1/3) ... [2023-11-21 22:16:07,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e878353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:16:07, skipping insertion in model container [2023-11-21 22:16:07,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:16:06" (2/3) ... [2023-11-21 22:16:07,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e878353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:16:07, skipping insertion in model container [2023-11-21 22:16:07,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:16:07" (3/3) ... [2023-11-21 22:16:07,428 INFO L112 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2023-11-21 22:16:07,437 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:16:07,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:16:07,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-21 22:16:07,448 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:16:07,523 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:16:07,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 113 transitions, 233 flow [2023-11-21 22:16:07,629 INFO L124 PetriNetUnfolderBase]: 8/176 cut-off events. [2023-11-21 22:16:07,629 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-21 22:16:07,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 8/176 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2023-11-21 22:16:07,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 113 transitions, 233 flow [2023-11-21 22:16:07,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 113 transitions, 233 flow [2023-11-21 22:16:07,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:16:07,669 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=LoopHeads, 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;@6d2c807c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:16:07,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-21 22:16:07,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:16:07,692 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-21 22:16:07,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:16:07,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:07,693 INFO L208 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] [2023-11-21 22:16:07,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-21 22:16:07,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1153270634, now seen corresponding path program 1 times [2023-11-21 22:16:07,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242088679] [2023-11-21 22:16:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:07,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:07,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242088679] [2023-11-21 22:16:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242088679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:07,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600272192] [2023-11-21 22:16:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:08,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:08,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:08,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2023-11-21 22:16:08,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 113 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-11-21 22:16:08,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:08,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2023-11-21 22:16:08,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:08,205 INFO L124 PetriNetUnfolderBase]: 7/207 cut-off events. [2023-11-21 22:16:08,205 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-21 22:16:08,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 207 events. 7/207 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs, 3 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2023-11-21 22:16:08,211 INFO L140 encePairwiseOnDemand]: 104/113 looper letters, 9 selfloop transitions, 4 changer transitions 1/112 dead transitions. [2023-11-21 22:16:08,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 257 flow [2023-11-21 22:16:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-11-21 22:16:08,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9321533923303835 [2023-11-21 22:16:08,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-11-21 22:16:08,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-11-21 22:16:08,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:08,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-11-21 22:16:08,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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-11-21 22:16:08,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:08,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:08,259 INFO L175 Difference]: Start difference. First operand has 110 places, 113 transitions, 233 flow. Second operand 3 states and 316 transitions. [2023-11-21 22:16:08,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 257 flow [2023-11-21 22:16:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:16:08,270 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 253 flow [2023-11-21 22:16:08,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2023-11-21 22:16:08,277 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2023-11-21 22:16:08,278 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 253 flow [2023-11-21 22:16:08,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-11-21 22:16:08,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:08,279 INFO L208 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-11-21 22:16:08,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:16:08,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-21 22:16:08,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:08,282 INFO L85 PathProgramCache]: Analyzing trace with hash -696390061, now seen corresponding path program 1 times [2023-11-21 22:16:08,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:08,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046247129] [2023-11-21 22:16:08,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:08,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:08,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046247129] [2023-11-21 22:16:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046247129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:08,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:16:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635126369] [2023-11-21 22:16:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:08,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:16:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:08,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:16:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:16:09,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2023-11-21 22:16:09,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-11-21 22:16:09,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:09,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2023-11-21 22:16:09,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:09,245 INFO L124 PetriNetUnfolderBase]: 6/199 cut-off events. [2023-11-21 22:16:09,245 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-21 22:16:09,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 199 events. 6/199 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 471 event pairs, 1 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 137. Up to 31 conditions per place. [2023-11-21 22:16:09,248 INFO L140 encePairwiseOnDemand]: 97/113 looper letters, 20 selfloop transitions, 9 changer transitions 4/120 dead transitions. [2023-11-21 22:16:09,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 120 transitions, 337 flow [2023-11-21 22:16:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:16:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:16:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2023-11-21 22:16:09,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8053097345132744 [2023-11-21 22:16:09,252 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2023-11-21 22:16:09,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2023-11-21 22:16:09,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:09,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2023-11-21 22:16:09,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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-11-21 22:16:09,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-11-21 22:16:09,259 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-11-21 22:16:09,259 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 253 flow. Second operand 6 states and 546 transitions. [2023-11-21 22:16:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 120 transitions, 337 flow [2023-11-21 22:16:09,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:09,265 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 312 flow [2023-11-21 22:16:09,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2023-11-21 22:16:09,266 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 7 predicate places. [2023-11-21 22:16:09,267 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 312 flow [2023-11-21 22:16:09,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 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-11-21 22:16:09,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:09,268 INFO L208 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, 1, 1, 1] [2023-11-21 22:16:09,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:16:09,269 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-21 22:16:09,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1771011422, now seen corresponding path program 1 times [2023-11-21 22:16:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521095668] [2023-11-21 22:16:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:09,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521095668] [2023-11-21 22:16:09,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521095668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:09,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461612250] [2023-11-21 22:16:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:09,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:09,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 113 [2023-11-21 22:16:09,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-11-21 22:16:09,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:09,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 113 [2023-11-21 22:16:09,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:09,398 INFO L124 PetriNetUnfolderBase]: 8/315 cut-off events. [2023-11-21 22:16:09,398 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2023-11-21 22:16:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 315 events. 8/315 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1023 event pairs, 1 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 309. Up to 14 conditions per place. [2023-11-21 22:16:09,401 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 7 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2023-11-21 22:16:09,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 343 flow [2023-11-21 22:16:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-21 22:16:09,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.943952802359882 [2023-11-21 22:16:09,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-21 22:16:09,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-21 22:16:09,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:09,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-21 22:16:09,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-11-21 22:16:09,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:09,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:09,408 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 312 flow. Second operand 3 states and 320 transitions. [2023-11-21 22:16:09,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 343 flow [2023-11-21 22:16:09,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 334 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-21 22:16:09,415 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 329 flow [2023-11-21 22:16:09,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2023-11-21 22:16:09,417 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2023-11-21 22:16:09,417 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 329 flow [2023-11-21 22:16:09,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-11-21 22:16:09,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:09,418 INFO L208 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, 1, 1, 1] [2023-11-21 22:16:09,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:16:09,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-21 22:16:09,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash -903876076, now seen corresponding path program 1 times [2023-11-21 22:16:09,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882615224] [2023-11-21 22:16:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882615224] [2023-11-21 22:16:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882615224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683983224] [2023-11-21 22:16:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:09,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:09,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:09,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 113 [2023-11-21 22:16:09,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-11-21 22:16:09,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:09,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 113 [2023-11-21 22:16:09,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:09,542 INFO L124 PetriNetUnfolderBase]: 25/379 cut-off events. [2023-11-21 22:16:09,542 INFO L125 PetriNetUnfolderBase]: For 53/56 co-relation queries the response was YES. [2023-11-21 22:16:09,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 379 events. 25/379 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1403 event pairs, 3 based on Foata normal form. 1/343 useless extension candidates. Maximal degree in co-relation 376. Up to 44 conditions per place. [2023-11-21 22:16:09,546 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 6 changer transitions 0/123 dead transitions. [2023-11-21 22:16:09,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 375 flow [2023-11-21 22:16:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-21 22:16:09,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9174041297935103 [2023-11-21 22:16:09,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-21 22:16:09,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-21 22:16:09,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:09,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-21 22:16:09,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-11-21 22:16:09,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:09,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:09,553 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 329 flow. Second operand 3 states and 311 transitions. [2023-11-21 22:16:09,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 375 flow [2023-11-21 22:16:09,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:09,559 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 369 flow [2023-11-21 22:16:09,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2023-11-21 22:16:09,560 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2023-11-21 22:16:09,561 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 369 flow [2023-11-21 22:16:09,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-11-21 22:16:09,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:09,561 INFO L208 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, 1, 1, 1, 1, 1, 1] [2023-11-21 22:16:09,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:16:09,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-21 22:16:09,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:09,563 INFO L85 PathProgramCache]: Analyzing trace with hash 823299659, now seen corresponding path program 1 times [2023-11-21 22:16:09,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112380085] [2023-11-21 22:16:09,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:09,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112380085] [2023-11-21 22:16:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112380085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:09,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:09,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419598004] [2023-11-21 22:16:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:09,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:09,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:09,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 113 [2023-11-21 22:16:09,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-11-21 22:16:09,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:09,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 113 [2023-11-21 22:16:09,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:09,704 INFO L124 PetriNetUnfolderBase]: 19/465 cut-off events. [2023-11-21 22:16:09,704 INFO L125 PetriNetUnfolderBase]: For 79/93 co-relation queries the response was YES. [2023-11-21 22:16:09,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 465 events. 19/465 cut-off events. For 79/93 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2078 event pairs, 0 based on Foata normal form. 4/438 useless extension candidates. Maximal degree in co-relation 454. Up to 26 conditions per place. [2023-11-21 22:16:09,707 INFO L140 encePairwiseOnDemand]: 109/113 looper letters, 6 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2023-11-21 22:16:09,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 400 flow [2023-11-21 22:16:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-21 22:16:09,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2023-11-21 22:16:09,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-21 22:16:09,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-21 22:16:09,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:09,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-21 22:16:09,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-11-21 22:16:09,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:09,714 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 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-11-21 22:16:09,714 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 369 flow. Second operand 3 states and 319 transitions. [2023-11-21 22:16:09,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 400 flow [2023-11-21 22:16:09,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:09,721 INFO L231 Difference]: Finished difference. Result has 124 places, 125 transitions, 385 flow [2023-11-21 22:16:09,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=124, PETRI_TRANSITIONS=125} [2023-11-21 22:16:09,722 INFO L281 CegarLoopForPetriNet]: 110 programPoint places, 14 predicate places. [2023-11-21 22:16:09,723 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 125 transitions, 385 flow [2023-11-21 22:16:09,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-11-21 22:16:09,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:09,724 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-21 22:16:09,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:16:09,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-11-21 22:16:09,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2136876547, now seen corresponding path program 1 times [2023-11-21 22:16:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083500287] [2023-11-21 22:16:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:16:09,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:16:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:16:09,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:16:09,814 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:16:09,816 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-21 22:16:09,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-21 22:16:09,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-21 22:16:09,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-21 22:16:09,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-21 22:16:09,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-21 22:16:09,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-21 22:16:09,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-21 22:16:09,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-21 22:16:09,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-21 22:16:09,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-21 22:16:09,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:16:09,823 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-21 22:16:09,826 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:16:09,826 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:16:09,882 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:16:09,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 128 transitions, 272 flow [2023-11-21 22:16:09,944 INFO L124 PetriNetUnfolderBase]: 15/305 cut-off events. [2023-11-21 22:16:09,945 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-21 22:16:09,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 305 events. 15/305 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 690 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 178. Up to 8 conditions per place. [2023-11-21 22:16:09,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 128 transitions, 272 flow [2023-11-21 22:16:09,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 128 transitions, 272 flow [2023-11-21 22:16:09,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:16:09,958 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=LoopHeads, 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;@6d2c807c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:16:09,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-21 22:16:09,962 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:16:09,962 INFO L124 PetriNetUnfolderBase]: 2/39 cut-off events. [2023-11-21 22:16:09,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:16:09,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:09,963 INFO L208 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] [2023-11-21 22:16:09,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:09,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash 612998422, now seen corresponding path program 1 times [2023-11-21 22:16:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:09,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113580652] [2023-11-21 22:16:09,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:09,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113580652] [2023-11-21 22:16:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113580652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159450690] [2023-11-21 22:16:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:10,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:10,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:10,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:10,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128 [2023-11-21 22:16:10,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 128 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-11-21 22:16:10,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:10,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128 [2023-11-21 22:16:10,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:10,128 INFO L124 PetriNetUnfolderBase]: 43/526 cut-off events. [2023-11-21 22:16:10,128 INFO L125 PetriNetUnfolderBase]: For 32/42 co-relation queries the response was YES. [2023-11-21 22:16:10,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 526 events. 43/526 cut-off events. For 32/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2259 event pairs, 23 based on Foata normal form. 50/500 useless extension candidates. Maximal degree in co-relation 344. Up to 83 conditions per place. [2023-11-21 22:16:10,133 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 12 selfloop transitions, 5 changer transitions 1/127 dead transitions. [2023-11-21 22:16:10,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 127 transitions, 304 flow [2023-11-21 22:16:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-21 22:16:10,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9244791666666666 [2023-11-21 22:16:10,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-21 22:16:10,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-21 22:16:10,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:10,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-21 22:16:10,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-11-21 22:16:10,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:10,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:10,140 INFO L175 Difference]: Start difference. First operand has 124 places, 128 transitions, 272 flow. Second operand 3 states and 355 transitions. [2023-11-21 22:16:10,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 127 transitions, 304 flow [2023-11-21 22:16:10,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:16:10,144 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 298 flow [2023-11-21 22:16:10,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2023-11-21 22:16:10,146 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2023-11-21 22:16:10,146 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 298 flow [2023-11-21 22:16:10,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-11-21 22:16:10,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:10,147 INFO L208 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-11-21 22:16:10,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:16:10,147 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:10,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1776624045, now seen corresponding path program 1 times [2023-11-21 22:16:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283527239] [2023-11-21 22:16:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283527239] [2023-11-21 22:16:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283527239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:16:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383277665] [2023-11-21 22:16:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:10,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:16:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:10,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:16:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:16:10,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 128 [2023-11-21 22:16:10,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 298 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-11-21 22:16:10,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:10,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 128 [2023-11-21 22:16:10,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:10,805 INFO L124 PetriNetUnfolderBase]: 29/446 cut-off events. [2023-11-21 22:16:10,805 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-21 22:16:10,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 446 events. 29/446 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1703 event pairs, 9 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 315. Up to 72 conditions per place. [2023-11-21 22:16:10,809 INFO L140 encePairwiseOnDemand]: 112/128 looper letters, 22 selfloop transitions, 9 changer transitions 4/135 dead transitions. [2023-11-21 22:16:10,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 135 transitions, 386 flow [2023-11-21 22:16:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:16:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:16:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2023-11-21 22:16:10,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8072916666666666 [2023-11-21 22:16:10,813 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 620 transitions. [2023-11-21 22:16:10,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 620 transitions. [2023-11-21 22:16:10,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:10,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 620 transitions. [2023-11-21 22:16:10,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-11-21 22:16:10,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-21 22:16:10,818 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-21 22:16:10,819 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 298 flow. Second operand 6 states and 620 transitions. [2023-11-21 22:16:10,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 135 transitions, 386 flow [2023-11-21 22:16:10,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:10,823 INFO L231 Difference]: Finished difference. Result has 131 places, 131 transitions, 355 flow [2023-11-21 22:16:10,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=131, PETRI_TRANSITIONS=131} [2023-11-21 22:16:10,824 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2023-11-21 22:16:10,825 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 131 transitions, 355 flow [2023-11-21 22:16:10,825 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-11-21 22:16:10,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:10,826 INFO L208 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, 1, 1, 1] [2023-11-21 22:16:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:16:10,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:10,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1646897487, now seen corresponding path program 1 times [2023-11-21 22:16:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376249667] [2023-11-21 22:16:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:10,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376249667] [2023-11-21 22:16:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376249667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:10,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514197632] [2023-11-21 22:16:10,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:10,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:10,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:10,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128 [2023-11-21 22:16:10,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 131 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-11-21 22:16:10,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:10,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128 [2023-11-21 22:16:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:11,244 INFO L124 PetriNetUnfolderBase]: 102/1429 cut-off events. [2023-11-21 22:16:11,245 INFO L125 PetriNetUnfolderBase]: For 130/178 co-relation queries the response was YES. [2023-11-21 22:16:11,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1429 events. 102/1429 cut-off events. For 130/178 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10368 event pairs, 25 based on Foata normal form. 5/1267 useless extension candidates. Maximal degree in co-relation 1738. Up to 93 conditions per place. [2023-11-21 22:16:11,258 INFO L140 encePairwiseOnDemand]: 121/128 looper letters, 14 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2023-11-21 22:16:11,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 139 transitions, 420 flow [2023-11-21 22:16:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-21 22:16:11,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9296875 [2023-11-21 22:16:11,261 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-21 22:16:11,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-21 22:16:11,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:11,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-21 22:16:11,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-11-21 22:16:11,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:11,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:11,266 INFO L175 Difference]: Start difference. First operand has 131 places, 131 transitions, 355 flow. Second operand 3 states and 357 transitions. [2023-11-21 22:16:11,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 139 transitions, 420 flow [2023-11-21 22:16:11,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 411 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-21 22:16:11,274 INFO L231 Difference]: Finished difference. Result has 134 places, 136 transitions, 390 flow [2023-11-21 22:16:11,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=134, PETRI_TRANSITIONS=136} [2023-11-21 22:16:11,276 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 10 predicate places. [2023-11-21 22:16:11,276 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 136 transitions, 390 flow [2023-11-21 22:16:11,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-11-21 22:16:11,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:11,277 INFO L208 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, 1, 1, 1] [2023-11-21 22:16:11,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:16:11,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:11,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash -27204972, now seen corresponding path program 1 times [2023-11-21 22:16:11,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111051691] [2023-11-21 22:16:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111051691] [2023-11-21 22:16:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111051691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257044099] [2023-11-21 22:16:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:11,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:11,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:11,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 128 [2023-11-21 22:16:11,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 136 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-11-21 22:16:11,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:11,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 128 [2023-11-21 22:16:11,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:11,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][109], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), Black: 144#true, 85#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,451 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,451 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,451 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,451 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][135], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), Black: 144#true, 39#L1022-1true, 96#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,465 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,465 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,466 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,466 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 38#L1035true, Black: 144#true, 85#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,475 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,475 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,476 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,476 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][93], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, Black: 133#true, 146#(= |#race~ready~0| 0), 38#L1035true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,487 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,487 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,488 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,488 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 133#true, 71#ULTIMATE.startFINALtrue, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, 146#(= |#race~ready~0| 0), Black: 144#true, 85#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,571 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-21 22:16:11,571 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-21 22:16:11,571 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:16:11,571 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:16:11,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][93], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 133#true, 71#ULTIMATE.startFINALtrue, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 150#true, 146#(= |#race~ready~0| 0), Black: 144#true, 39#L1022-1true, 96#L1022-2true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,575 INFO L294 olderBase$Statistics]: this new event has 94 ancestors and is cut-off event [2023-11-21 22:16:11,575 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:16:11,575 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:16:11,575 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-21 22:16:11,680 INFO L124 PetriNetUnfolderBase]: 298/1949 cut-off events. [2023-11-21 22:16:11,680 INFO L125 PetriNetUnfolderBase]: For 476/531 co-relation queries the response was YES. [2023-11-21 22:16:11,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 1949 events. 298/1949 cut-off events. For 476/531 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14651 event pairs, 48 based on Foata normal form. 8/1688 useless extension candidates. Maximal degree in co-relation 2296. Up to 348 conditions per place. [2023-11-21 22:16:11,699 INFO L140 encePairwiseOnDemand]: 122/128 looper letters, 14 selfloop transitions, 8 changer transitions 0/142 dead transitions. [2023-11-21 22:16:11,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 142 transitions, 458 flow [2023-11-21 22:16:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-21 22:16:11,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.90625 [2023-11-21 22:16:11,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-21 22:16:11,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-21 22:16:11,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:11,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-21 22:16:11,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-11-21 22:16:11,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:11,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:11,706 INFO L175 Difference]: Start difference. First operand has 134 places, 136 transitions, 390 flow. Second operand 3 states and 348 transitions. [2023-11-21 22:16:11,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 142 transitions, 458 flow [2023-11-21 22:16:11,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 142 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:11,713 INFO L231 Difference]: Finished difference. Result has 136 places, 142 transitions, 446 flow [2023-11-21 22:16:11,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=136, PETRI_TRANSITIONS=142} [2023-11-21 22:16:11,715 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 12 predicate places. [2023-11-21 22:16:11,715 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 446 flow [2023-11-21 22:16:11,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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-11-21 22:16:11,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:11,716 INFO L208 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, 1, 1, 1, 1, 1, 1] [2023-11-21 22:16:11,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:16:11,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:11,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:11,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1311194984, now seen corresponding path program 1 times [2023-11-21 22:16:11,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:11,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571626064] [2023-11-21 22:16:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:11,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571626064] [2023-11-21 22:16:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571626064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:11,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:16:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857894241] [2023-11-21 22:16:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:11,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:11,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 128 [2023-11-21 22:16:11,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 142 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-11-21 22:16:11,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:11,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 128 [2023-11-21 22:16:11,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:11,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][111], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,926 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,926 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,926 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,927 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][142], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,928 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,928 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:11,928 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,928 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:11,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 38#L1035true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,943 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,943 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,943 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,943 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][92], [Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 150#true, 38#L1035true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:11,962 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,962 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:11,962 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:11,962 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:12,381 INFO L124 PetriNetUnfolderBase]: 386/3533 cut-off events. [2023-11-21 22:16:12,382 INFO L125 PetriNetUnfolderBase]: For 995/1451 co-relation queries the response was YES. [2023-11-21 22:16:12,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 3533 events. 386/3533 cut-off events. For 995/1451 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 33901 event pairs, 41 based on Foata normal form. 33/3235 useless extension candidates. Maximal degree in co-relation 4169. Up to 355 conditions per place. [2023-11-21 22:16:12,417 INFO L140 encePairwiseOnDemand]: 121/128 looper letters, 16 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2023-11-21 22:16:12,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 152 transitions, 533 flow [2023-11-21 22:16:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-21 22:16:12,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9296875 [2023-11-21 22:16:12,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-21 22:16:12,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-21 22:16:12,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:12,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-21 22:16:12,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-11-21 22:16:12,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:12,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:12,424 INFO L175 Difference]: Start difference. First operand has 136 places, 142 transitions, 446 flow. Second operand 3 states and 357 transitions. [2023-11-21 22:16:12,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 152 transitions, 533 flow [2023-11-21 22:16:12,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:12,438 INFO L231 Difference]: Finished difference. Result has 138 places, 149 transitions, 500 flow [2023-11-21 22:16:12,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=138, PETRI_TRANSITIONS=149} [2023-11-21 22:16:12,441 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places. [2023-11-21 22:16:12,441 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 149 transitions, 500 flow [2023-11-21 22:16:12,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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-11-21 22:16:12,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:12,442 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:16:12,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:16:12,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:12,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1669507446, now seen corresponding path program 1 times [2023-11-21 22:16:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82249469] [2023-11-21 22:16:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82249469] [2023-11-21 22:16:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82249469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:16:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048866968] [2023-11-21 22:16:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:12,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:16:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:16:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:16:12,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 128 [2023-11-21 22:16:12,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 149 transitions, 500 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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-11-21 22:16:12,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:12,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 128 [2023-11-21 22:16:12,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:12,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][101], [Black: 158#(= |#race~data~0| 0), 30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:12,767 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:12,767 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:12,768 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:12,768 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:12,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][142], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:12,769 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:12,769 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:12,769 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:12,769 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:12,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][58], [Black: 158#(= |#race~data~0| 0), 30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, 156#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:12,783 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:12,784 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:12,784 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:12,784 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:12,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][79], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, 156#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:12,801 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:12,801 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:12,802 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:12,802 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:13,244 INFO L124 PetriNetUnfolderBase]: 362/3524 cut-off events. [2023-11-21 22:16:13,245 INFO L125 PetriNetUnfolderBase]: For 772/940 co-relation queries the response was YES. [2023-11-21 22:16:13,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 3524 events. 362/3524 cut-off events. For 772/940 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 34046 event pairs, 33 based on Foata normal form. 1/3270 useless extension candidates. Maximal degree in co-relation 4279. Up to 328 conditions per place. [2023-11-21 22:16:13,279 INFO L140 encePairwiseOnDemand]: 121/128 looper letters, 14 selfloop transitions, 2 changer transitions 4/150 dead transitions. [2023-11-21 22:16:13,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 150 transitions, 528 flow [2023-11-21 22:16:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:16:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:16:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions. [2023-11-21 22:16:13,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.87109375 [2023-11-21 22:16:13,283 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 669 transitions. [2023-11-21 22:16:13,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions. [2023-11-21 22:16:13,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:13,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions. [2023-11-21 22:16:13,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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-11-21 22:16:13,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-21 22:16:13,289 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 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-11-21 22:16:13,289 INFO L175 Difference]: Start difference. First operand has 138 places, 149 transitions, 500 flow. Second operand 6 states and 669 transitions. [2023-11-21 22:16:13,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 150 transitions, 528 flow [2023-11-21 22:16:13,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 150 transitions, 506 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-21 22:16:13,301 INFO L231 Difference]: Finished difference. Result has 145 places, 146 transitions, 476 flow [2023-11-21 22:16:13,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=145, PETRI_TRANSITIONS=146} [2023-11-21 22:16:13,302 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 21 predicate places. [2023-11-21 22:16:13,303 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 146 transitions, 476 flow [2023-11-21 22:16:13,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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-11-21 22:16:13,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:13,303 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:16:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:16:13,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:13,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -139954277, now seen corresponding path program 1 times [2023-11-21 22:16:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:13,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66201308] [2023-11-21 22:16:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:16:13,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:13,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66201308] [2023-11-21 22:16:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66201308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:16:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283404112] [2023-11-21 22:16:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:13,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:16:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:13,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:16:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:16:13,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 128 [2023-11-21 22:16:13,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 146 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-11-21 22:16:13,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:13,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 128 [2023-11-21 22:16:13,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:13,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][83], [30#L1022-1true, Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:13,509 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:13,509 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:13,509 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:13,510 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:13,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][121], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 83#L1034-4true, 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:13,513 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-11-21 22:16:13,513 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:13,513 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-21 22:16:13,513 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-11-21 22:16:13,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][41], [Black: 158#(= |#race~data~0| 0), 30#L1022-1true, Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, Black: 144#true, 85#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:13,524 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:13,524 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:13,525 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:13,525 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:13,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([399] L1022-4-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][63], [Black: 158#(= |#race~data~0| 0), Black: 129#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 162#true, Black: 164#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 165#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 168#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 136#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 137#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 174#true, Black: 135#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 133#true, 38#L1035true, Black: 144#true, 39#L1022-1true, 96#L1022-2true, Black: 152#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse]) [2023-11-21 22:16:13,536 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:16:13,536 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:13,536 INFO L297 olderBase$Statistics]: existing Event has 75 ancestors and is cut-off event [2023-11-21 22:16:13,537 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:16:13,808 INFO L124 PetriNetUnfolderBase]: 217/1965 cut-off events. [2023-11-21 22:16:13,808 INFO L125 PetriNetUnfolderBase]: For 373/545 co-relation queries the response was YES. [2023-11-21 22:16:13,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 1965 events. 217/1965 cut-off events. For 373/545 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 15916 event pairs, 34 based on Foata normal form. 9/1857 useless extension candidates. Maximal degree in co-relation 2912. Up to 214 conditions per place. [2023-11-21 22:16:13,830 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 6 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2023-11-21 22:16:13,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 434 flow [2023-11-21 22:16:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:16:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:16:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-21 22:16:13,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9244791666666666 [2023-11-21 22:16:13,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-21 22:16:13,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-21 22:16:13,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:13,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-21 22:16:13,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-11-21 22:16:13,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:13,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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-11-21 22:16:13,837 INFO L175 Difference]: Start difference. First operand has 145 places, 146 transitions, 476 flow. Second operand 3 states and 355 transitions. [2023-11-21 22:16:13,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 434 flow [2023-11-21 22:16:13,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 412 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-21 22:16:13,846 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 406 flow [2023-11-21 22:16:13,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2023-11-21 22:16:13,848 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 13 predicate places. [2023-11-21 22:16:13,848 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 406 flow [2023-11-21 22:16:13,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-11-21 22:16:13,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:13,849 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:16:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:16:13,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-21 22:16:13,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1678731226, now seen corresponding path program 1 times [2023-11-21 22:16:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448837247] [2023-11-21 22:16:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:16:13,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:16:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:16:13,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:16:13,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:16:13,905 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2023-11-21 22:16:13,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2023-11-21 22:16:13,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2023-11-21 22:16:13,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2023-11-21 22:16:13,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2023-11-21 22:16:13,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2023-11-21 22:16:13,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2023-11-21 22:16:13,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-11-21 22:16:13,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2023-11-21 22:16:13,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2023-11-21 22:16:13,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2023-11-21 22:16:13,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2023-11-21 22:16:13,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2023-11-21 22:16:13,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:16:13,909 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:16:13,915 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-21 22:16:13,915 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:16:13,949 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-21 22:16:13,950 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4 [2023-11-21 22:16:13,951 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:13,952 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:13,952 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:13,952 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:13,953 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:13,953 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:13,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-21 22:16:13,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-21 22:16:13,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-21 22:16:13,955 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-21 22:16:13,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:16:13 BasicIcfg [2023-11-21 22:16:13,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:16:13,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:16:13,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:16:13,967 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:16:13,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:16:07" (3/4) ... [2023-11-21 22:16:13,970 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:16:13,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:16:13,972 INFO L158 Benchmark]: Toolchain (without parser) took 8032.06ms. Allocated memory was 136.3MB in the beginning and 308.3MB in the end (delta: 172.0MB). Free memory was 89.9MB in the beginning and 184.1MB in the end (delta: -94.2MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2023-11-21 22:16:13,972 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory was 49.9MB in the beginning and 49.7MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:16:13,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 804.61ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 102.5MB in the end (delta: -12.9MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2023-11-21 22:16:13,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.69ms. Allocated memory is still 136.3MB. Free memory was 102.5MB in the beginning and 100.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:16:13,973 INFO L158 Benchmark]: Boogie Preprocessor took 62.36ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 98.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:16:13,974 INFO L158 Benchmark]: RCFGBuilder took 512.95ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 81.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-21 22:16:13,974 INFO L158 Benchmark]: TraceAbstraction took 6544.51ms. Allocated memory was 136.3MB in the beginning and 308.3MB in the end (delta: 172.0MB). Free memory was 81.2MB in the beginning and 184.1MB in the end (delta: -102.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2023-11-21 22:16:13,975 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 308.3MB. Free memory is still 184.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:16:13,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 98.6MB. Free memory was 49.9MB in the beginning and 49.7MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 804.61ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 102.5MB in the end (delta: -12.9MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.69ms. Allocated memory is still 136.3MB. Free memory was 102.5MB in the beginning and 100.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.36ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 98.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.95ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 81.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6544.51ms. Allocated memory was 136.3MB in the beginning and 308.3MB in the end (delta: 172.0MB). Free memory was 81.2MB in the beginning and 184.1MB in the end (delta: -102.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 308.3MB. Free memory is still 184.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem7 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1022]: Data race detected [2023-11-21 22:16:14,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-21 22:16:14,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4 [2023-11-21 22:16:14,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:14,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:14,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:14,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:14,002 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:14,003 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:14,003 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-21 22:16:14,004 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-21 22:16:14,004 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-21 22:16:14,004 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated [2023-11-21 22:16:14,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-21 22:16:14,019 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc4 [2023-11-21 22:16:14,020 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:14,020 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:14,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:14,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:14,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem7 [2023-11-21 22:16:14,021 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2023-11-21 22:16:14,022 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-21 22:16:14,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-21 22:16:14,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet10 could not be translated [2023-11-21 22:16:14,023 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet11 could not be translated Data race detected The following path leads to a data race: [L1019] 0 _Bool ready = 0; VAL [ready=0] [L1020] 0 int data = 0; VAL [data=0, ready=0] [L1027] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, ready=0, threads_total=1] [L1028] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, ready=0] [L1028] RET 0 assume_abort_if_not(threads_total >= 0) [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={5:0}] [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={5:0}] [L1030] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1030] COND TRUE 0 i < threads_total VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1031] EXPR 0 \read(*tids) VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1031] EXPR 0 tids[i] VAL [data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1031] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [arg={0:0}, data=0, i=0, ready=0, threads_total=1, tids={5:0}] [L1022] 1 !ready VAL [arg={0:0}, arg={0:0}, data=0, ready=0] [L1030] 0 i++ VAL [arg={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={5:0}] [L1030] COND FALSE 0 !(i < threads_total) VAL [arg={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={5:0}] [L1033] 0 data = __VERIFIER_nondet_int() VAL [arg={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={5:0}] [L1034] 0 ready = 1 VAL [arg={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={5:0}] [L1022] 1 !ready VAL [arg={0:0}, arg={0:0}, data=0, ready=1] Now there is a data race on ~ready~0 between C: ready = 1 [1034] and C: !ready [1022] - UnprovableResult [Line: 1033]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 6 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 132 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 23 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-21 22:16:14,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8009fed2-9646-43aa-8f5c-98cac4bee14f/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE