./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/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_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB --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.3.0-dev-d790fec [2024-11-28 03:35:16,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:35:16,245 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:35:16,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:35:16,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:35:16,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:35:16,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:35:16,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:35:16,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:35:16,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:35:16,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:35:16,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:35:16,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:35:16,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:35:16,291 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:35:16,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:35:16,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:35:16,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:35:16,292 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:35:16,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:35:16,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:35:16,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:35:16,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:35:16,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:35:16,293 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:35:16,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:35:16,295 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB 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 [2024-11-28 03:35:16,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:35:16,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:35:16,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:35:16,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:35:16,593 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:35:16,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-11-28 03:35:19,714 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/data/16a592c6e/b121295c232a4a649f2a494de710aaad/FLAG538c67e1e [2024-11-28 03:35:20,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:35:20,233 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2024-11-28 03:35:20,261 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/data/16a592c6e/b121295c232a4a649f2a494de710aaad/FLAG538c67e1e [2024-11-28 03:35:20,310 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/data/16a592c6e/b121295c232a4a649f2a494de710aaad [2024-11-28 03:35:20,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:35:20,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:35:20,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:35:20,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:35:20,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:35:20,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:20,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512cb27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20, skipping insertion in model container [2024-11-28 03:35:20,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:20,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:35:20,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:35:20,838 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:35:20,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:35:20,947 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:35:20,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20 WrapperNode [2024-11-28 03:35:20,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:35:20,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:35:20,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:35:20,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:35:20,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:20,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:20,995 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-11-28 03:35:20,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:35:20,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:35:20,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:35:20,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:35:21,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:35:21,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:35:21,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:35:21,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:35:21,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (1/1) ... [2024-11-28 03:35:21,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:35:21,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:21,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:35:21,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:35:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:35:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:35:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:35:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:35:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-28 03:35:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-28 03:35:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:35:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:35:21,106 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:35:21,221 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:35:21,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:35:21,421 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:35:21,422 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:35:21,433 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:35:21,433 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:35:21,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:35:21 BoogieIcfgContainer [2024-11-28 03:35:21,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:35:21,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:35:21,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:35:21,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:35:21,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:35:20" (1/3) ... [2024-11-28 03:35:21,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564971ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:35:21, skipping insertion in model container [2024-11-28 03:35:21,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:35:20" (2/3) ... [2024-11-28 03:35:21,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564971ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:35:21, skipping insertion in model container [2024-11-28 03:35:21,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:35:21" (3/3) ... [2024-11-28 03:35:21,448 INFO L128 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2024-11-28 03:35:21,465 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:35:21,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG value-barrier-race.i that has 2 procedures, 88 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2024-11-28 03:35:21,468 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:35:21,557 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-28 03:35:21,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 94 transitions, 195 flow [2024-11-28 03:35:21,693 INFO L124 PetriNetUnfolderBase]: 8/140 cut-off events. [2024-11-28 03:35:21,695 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-28 03:35:21,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 8/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2024-11-28 03:35:21,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 94 transitions, 195 flow [2024-11-28 03:35:21,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 94 transitions, 195 flow [2024-11-28 03:35:21,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:35:21,725 INFO L333 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, 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;@2fb39801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:35:21,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-28 03:35:21,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:35:21,737 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-28 03:35:21,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:35:21,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:21,738 INFO L206 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] [2024-11-28 03:35:21,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1565640739, now seen corresponding path program 1 times [2024-11-28 03:35:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532761577] [2024-11-28 03:35:21,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:22,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:22,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532761577] [2024-11-28 03:35:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532761577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:22,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:22,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586455781] [2024-11-28 03:35:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:22,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:22,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:22,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:22,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:22,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2024-11-28 03:35:22,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2024-11-28 03:35:22,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:22,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2024-11-28 03:35:22,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:22,216 INFO L124 PetriNetUnfolderBase]: 7/171 cut-off events. [2024-11-28 03:35:22,216 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-28 03:35:22,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 171 events. 7/171 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 434 event pairs, 3 based on Foata normal form. 11/160 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2024-11-28 03:35:22,220 INFO L140 encePairwiseOnDemand]: 85/94 looper letters, 9 selfloop transitions, 4 changer transitions 1/93 dead transitions. [2024-11-28 03:35:22,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 219 flow [2024-11-28 03:35:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2024-11-28 03:35:22,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9184397163120568 [2024-11-28 03:35:22,243 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 195 flow. Second operand 3 states and 259 transitions. [2024-11-28 03:35:22,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 219 flow [2024-11-28 03:35:22,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:35:22,255 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 215 flow [2024-11-28 03:35:22,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-11-28 03:35:22,263 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2024-11-28 03:35:22,264 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 215 flow [2024-11-28 03:35:22,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2024-11-28 03:35:22,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:22,264 INFO L206 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] [2024-11-28 03:35:22,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:35:22,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:22,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1941913107, now seen corresponding path program 1 times [2024-11-28 03:35:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213712358] [2024-11-28 03:35:22,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:22,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:22,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213712358] [2024-11-28 03:35:22,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213712358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:35:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871112811] [2024-11-28 03:35:22,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:22,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:35:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:22,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:35:22,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:23,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 94 [2024-11-28 03:35:23,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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) [2024-11-28 03:35:23,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:23,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 94 [2024-11-28 03:35:23,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:23,284 INFO L124 PetriNetUnfolderBase]: 5/154 cut-off events. [2024-11-28 03:35:23,284 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-28 03:35:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 154 events. 5/154 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 357 event pairs, 1 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2024-11-28 03:35:23,285 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 14 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-11-28 03:35:23,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 251 flow [2024-11-28 03:35:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:35:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:35:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2024-11-28 03:35:23,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7801418439716312 [2024-11-28 03:35:23,290 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 215 flow. Second operand 6 states and 440 transitions. [2024-11-28 03:35:23,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 251 flow [2024-11-28 03:35:23,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:23,297 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 215 flow [2024-11-28 03:35:23,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-11-28 03:35:23,298 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2024-11-28 03:35:23,298 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 215 flow [2024-11-28 03:35:23,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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) [2024-11-28 03:35:23,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:23,299 INFO L206 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] [2024-11-28 03:35:23,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:35:23,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash 511021651, now seen corresponding path program 1 times [2024-11-28 03:35:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880304257] [2024-11-28 03:35:23,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:23,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:23,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:23,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880304257] [2024-11-28 03:35:23,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880304257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:23,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:23,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794656276] [2024-11-28 03:35:23,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:23,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:23,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:23,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:23,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:23,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2024-11-28 03:35:23,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2024-11-28 03:35:23,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:23,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2024-11-28 03:35:23,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:23,450 INFO L124 PetriNetUnfolderBase]: 18/223 cut-off events. [2024-11-28 03:35:23,451 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 03:35:23,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 223 events. 18/223 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 728 event pairs, 4 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2024-11-28 03:35:23,455 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 9 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2024-11-28 03:35:23,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 247 flow [2024-11-28 03:35:23,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-11-28 03:35:23,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900709219858156 [2024-11-28 03:35:23,457 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 215 flow. Second operand 3 states and 254 transitions. [2024-11-28 03:35:23,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 247 flow [2024-11-28 03:35:23,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 237 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:35:23,462 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 235 flow [2024-11-28 03:35:23,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2024-11-28 03:35:23,464 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2024-11-28 03:35:23,465 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 235 flow [2024-11-28 03:35:23,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2024-11-28 03:35:23,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:23,466 INFO L206 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] [2024-11-28 03:35:23,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:35:23,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash 427775778, now seen corresponding path program 1 times [2024-11-28 03:35:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:23,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136108177] [2024-11-28 03:35:23,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136108177] [2024-11-28 03:35:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136108177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357459198] [2024-11-28 03:35:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:23,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:23,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:23,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:23,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2024-11-28 03:35:23,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2024-11-28 03:35:23,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:23,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2024-11-28 03:35:23,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:23,605 INFO L124 PetriNetUnfolderBase]: 19/266 cut-off events. [2024-11-28 03:35:23,605 INFO L125 PetriNetUnfolderBase]: For 48/53 co-relation queries the response was YES. [2024-11-28 03:35:23,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 266 events. 19/266 cut-off events. For 48/53 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 951 event pairs, 1 based on Foata normal form. 1/236 useless extension candidates. Maximal degree in co-relation 263. Up to 24 conditions per place. [2024-11-28 03:35:23,610 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2024-11-28 03:35:23,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 99 transitions, 282 flow [2024-11-28 03:35:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-28 03:35:23,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2024-11-28 03:35:23,612 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 235 flow. Second operand 3 states and 263 transitions. [2024-11-28 03:35:23,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 99 transitions, 282 flow [2024-11-28 03:35:23,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 99 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:23,617 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 267 flow [2024-11-28 03:35:23,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2024-11-28 03:35:23,618 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2024-11-28 03:35:23,619 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 267 flow [2024-11-28 03:35:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2024-11-28 03:35:23,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:23,619 INFO L206 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] [2024-11-28 03:35:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:35:23,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 700491172, now seen corresponding path program 1 times [2024-11-28 03:35:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536078235] [2024-11-28 03:35:23,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536078235] [2024-11-28 03:35:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536078235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:23,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:23,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784541674] [2024-11-28 03:35:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:23,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:23,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:23,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2024-11-28 03:35:23,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2024-11-28 03:35:23,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:23,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2024-11-28 03:35:23,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:23,783 INFO L124 PetriNetUnfolderBase]: 19/332 cut-off events. [2024-11-28 03:35:23,783 INFO L125 PetriNetUnfolderBase]: For 72/84 co-relation queries the response was YES. [2024-11-28 03:35:23,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 332 events. 19/332 cut-off events. For 72/84 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1388 event pairs, 0 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 338. Up to 26 conditions per place. [2024-11-28 03:35:23,785 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 6 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2024-11-28 03:35:23,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 298 flow [2024-11-28 03:35:23,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-28 03:35:23,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2024-11-28 03:35:23,788 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 267 flow. Second operand 3 states and 262 transitions. [2024-11-28 03:35:23,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 298 flow [2024-11-28 03:35:23,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:23,794 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 287 flow [2024-11-28 03:35:23,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-11-28 03:35:23,795 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2024-11-28 03:35:23,795 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 287 flow [2024-11-28 03:35:23,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2024-11-28 03:35:23,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:23,795 INFO L206 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] [2024-11-28 03:35:23,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:35:23,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:23,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -835804487, now seen corresponding path program 1 times [2024-11-28 03:35:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335840947] [2024-11-28 03:35:23,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:24,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:24,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335840947] [2024-11-28 03:35:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335840947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:24,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:24,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:35:24,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144398994] [2024-11-28 03:35:24,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:24,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:35:24,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:24,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:35:24,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:35:24,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 94 [2024-11-28 03:35:24,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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) [2024-11-28 03:35:24,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:24,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 94 [2024-11-28 03:35:24,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:24,259 INFO L124 PetriNetUnfolderBase]: 19/338 cut-off events. [2024-11-28 03:35:24,259 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2024-11-28 03:35:24,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 338 events. 19/338 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1436 event pairs, 0 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2024-11-28 03:35:24,261 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 11 selfloop transitions, 2 changer transitions 5/105 dead transitions. [2024-11-28 03:35:24,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 333 flow [2024-11-28 03:35:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:35:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:35:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2024-11-28 03:35:24,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528368794326241 [2024-11-28 03:35:24,265 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 287 flow. Second operand 6 states and 481 transitions. [2024-11-28 03:35:24,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 333 flow [2024-11-28 03:35:24,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:24,271 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 297 flow [2024-11-28 03:35:24,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2024-11-28 03:35:24,272 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 15 predicate places. [2024-11-28 03:35:24,272 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 297 flow [2024-11-28 03:35:24,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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) [2024-11-28 03:35:24,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:24,276 INFO L206 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] [2024-11-28 03:35:24,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:35:24,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-28 03:35:24,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:24,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1222908061, now seen corresponding path program 1 times [2024-11-28 03:35:24,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:24,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112289749] [2024-11-28 03:35:24,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:35:24,320 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:35:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:35:24,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:35:24,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:35:24,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-28 03:35:24,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-28 03:35:24,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-28 03:35:24,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-28 03:35:24,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-28 03:35:24,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-28 03:35:24,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-28 03:35:24,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-28 03:35:24,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-28 03:35:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:35:24,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:24,379 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-28 03:35:24,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-28 03:35:24,409 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 03:35:24,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 109 transitions, 234 flow [2024-11-28 03:35:24,461 INFO L124 PetriNetUnfolderBase]: 15/233 cut-off events. [2024-11-28 03:35:24,461 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 03:35:24,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 233 events. 15/233 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 464 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2024-11-28 03:35:24,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 109 transitions, 234 flow [2024-11-28 03:35:24,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 109 transitions, 234 flow [2024-11-28 03:35:24,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:35:24,466 INFO L333 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, 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;@2fb39801, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:35:24,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-28 03:35:24,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:35:24,474 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2024-11-28 03:35:24,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:35:24,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:24,474 INFO L206 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] [2024-11-28 03:35:24,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:24,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:24,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1051689315, now seen corresponding path program 1 times [2024-11-28 03:35:24,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:24,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676392197] [2024-11-28 03:35:24,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:24,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:24,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676392197] [2024-11-28 03:35:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676392197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:24,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254061165] [2024-11-28 03:35:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:24,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:24,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:24,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:24,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-11-28 03:35:24,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 109 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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) [2024-11-28 03:35:24,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:24,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-11-28 03:35:24,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:24,661 INFO L124 PetriNetUnfolderBase]: 43/436 cut-off events. [2024-11-28 03:35:24,661 INFO L125 PetriNetUnfolderBase]: For 36/43 co-relation queries the response was YES. [2024-11-28 03:35:24,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 436 events. 43/436 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1873 event pairs, 23 based on Foata normal form. 51/422 useless extension candidates. Maximal degree in co-relation 309. Up to 83 conditions per place. [2024-11-28 03:35:24,666 INFO L140 encePairwiseOnDemand]: 98/109 looper letters, 12 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2024-11-28 03:35:24,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 266 flow [2024-11-28 03:35:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-11-28 03:35:24,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113149847094801 [2024-11-28 03:35:24,668 INFO L175 Difference]: Start difference. First operand has 105 places, 109 transitions, 234 flow. Second operand 3 states and 298 transitions. [2024-11-28 03:35:24,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 108 transitions, 266 flow [2024-11-28 03:35:24,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:35:24,674 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 260 flow [2024-11-28 03:35:24,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2024-11-28 03:35:24,675 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2024-11-28 03:35:24,675 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 260 flow [2024-11-28 03:35:24,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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) [2024-11-28 03:35:24,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:24,676 INFO L206 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] [2024-11-28 03:35:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:35:24,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:24,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1955830195, now seen corresponding path program 1 times [2024-11-28 03:35:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114790154] [2024-11-28 03:35:24,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:24,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114790154] [2024-11-28 03:35:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114790154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:25,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:35:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811152504] [2024-11-28 03:35:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:35:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:25,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:35:25,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:25,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 109 [2024-11-28 03:35:25,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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) [2024-11-28 03:35:25,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:25,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 109 [2024-11-28 03:35:25,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:25,368 INFO L124 PetriNetUnfolderBase]: 28/353 cut-off events. [2024-11-28 03:35:25,368 INFO L125 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2024-11-28 03:35:25,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 353 events. 28/353 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1319 event pairs, 9 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 273. Up to 45 conditions per place. [2024-11-28 03:35:25,372 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 16 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2024-11-28 03:35:25,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 300 flow [2024-11-28 03:35:25,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:35:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:35:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2024-11-28 03:35:25,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7859327217125383 [2024-11-28 03:35:25,377 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 260 flow. Second operand 6 states and 514 transitions. [2024-11-28 03:35:25,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 300 flow [2024-11-28 03:35:25,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:25,382 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 258 flow [2024-11-28 03:35:25,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2024-11-28 03:35:25,382 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2024-11-28 03:35:25,383 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 258 flow [2024-11-28 03:35:25,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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) [2024-11-28 03:35:25,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:25,383 INFO L206 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] [2024-11-28 03:35:25,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:35:25,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:25,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:25,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1666500109, now seen corresponding path program 1 times [2024-11-28 03:35:25,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:25,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648126699] [2024-11-28 03:35:25,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:25,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:25,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648126699] [2024-11-28 03:35:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648126699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:25,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:25,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:25,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199721569] [2024-11-28 03:35:25,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:25,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:25,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:25,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:25,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:25,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 109 [2024-11-28 03:35:25,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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) [2024-11-28 03:35:25,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:25,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 109 [2024-11-28 03:35:25,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:25,586 INFO L124 PetriNetUnfolderBase]: 119/767 cut-off events. [2024-11-28 03:35:25,586 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2024-11-28 03:35:25,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 767 events. 119/767 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4388 event pairs, 39 based on Foata normal form. 0/611 useless extension candidates. Maximal degree in co-relation 732. Up to 129 conditions per place. [2024-11-28 03:35:25,594 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 12 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2024-11-28 03:35:25,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 110 transitions, 300 flow [2024-11-28 03:35:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-11-28 03:35:25,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8899082568807339 [2024-11-28 03:35:25,596 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 258 flow. Second operand 3 states and 291 transitions. [2024-11-28 03:35:25,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 110 transitions, 300 flow [2024-11-28 03:35:25,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 110 transitions, 290 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:35:25,600 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 286 flow [2024-11-28 03:35:25,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2024-11-28 03:35:25,601 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2024-11-28 03:35:25,602 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 286 flow [2024-11-28 03:35:25,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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) [2024-11-28 03:35:25,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:25,602 INFO L206 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] [2024-11-28 03:35:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:35:25,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1749358699, now seen corresponding path program 1 times [2024-11-28 03:35:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740591464] [2024-11-28 03:35:25,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:25,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:25,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740591464] [2024-11-28 03:35:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740591464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961141754] [2024-11-28 03:35:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:25,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:25,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:25,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-11-28 03:35:25,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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) [2024-11-28 03:35:25,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:25,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-11-28 03:35:25,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:25,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][102], [72#L1022-2true, 106#true, 26#L1022-1true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 68#L1034-4true, 126#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 119#true]) [2024-11-28 03:35:25,794 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:25,794 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:25,794 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:25,794 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:25,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][113], [34#L1022-1true, 106#true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 126#(= |#race~ready~0| 0), 68#L1034-4true, 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 119#true]) [2024-11-28 03:35:25,807 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:25,807 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:25,807 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:25,807 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:25,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [72#L1022-2true, 106#true, 26#L1022-1true, 33#L1035true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 126#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 119#true]) [2024-11-28 03:35:25,813 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:25,813 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:25,813 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:25,813 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:25,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][90], [34#L1022-1true, 106#true, 33#L1035true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 126#(= |#race~ready~0| 0), 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 119#true]) [2024-11-28 03:35:25,825 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:25,826 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:25,826 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:25,826 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:25,906 INFO L124 PetriNetUnfolderBase]: 235/1380 cut-off events. [2024-11-28 03:35:25,907 INFO L125 PetriNetUnfolderBase]: For 410/493 co-relation queries the response was YES. [2024-11-28 03:35:25,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 1380 events. 235/1380 cut-off events. For 410/493 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10182 event pairs, 33 based on Foata normal form. 6/1151 useless extension candidates. Maximal degree in co-relation 1628. Up to 253 conditions per place. [2024-11-28 03:35:25,917 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 16 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2024-11-28 03:35:25,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 120 transitions, 379 flow [2024-11-28 03:35:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-28 03:35:25,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2024-11-28 03:35:25,919 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 286 flow. Second operand 3 states and 300 transitions. [2024-11-28 03:35:25,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 120 transitions, 379 flow [2024-11-28 03:35:25,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 120 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:25,924 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 346 flow [2024-11-28 03:35:25,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2024-11-28 03:35:25,927 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2024-11-28 03:35:25,927 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 346 flow [2024-11-28 03:35:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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) [2024-11-28 03:35:25,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:25,928 INFO L206 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] [2024-11-28 03:35:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:35:25,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash -11468002, now seen corresponding path program 1 times [2024-11-28 03:35:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229522823] [2024-11-28 03:35:25,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:25,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:25,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229522823] [2024-11-28 03:35:25,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229522823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:25,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:25,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:25,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778226466] [2024-11-28 03:35:25,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:25,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:25,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:25,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:25,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:25,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 109 [2024-11-28 03:35:25,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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) [2024-11-28 03:35:25,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:25,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 109 [2024-11-28 03:35:25,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:26,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][119], [34#L1022-1true, 106#true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 129#true, 68#L1034-4true, 126#(= |#race~ready~0| 0), 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,110 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,110 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,110 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,110 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][103], [72#L1022-2true, 106#true, 26#L1022-1true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 129#true, 126#(= |#race~ready~0| 0), 68#L1034-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,114 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,114 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,114 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,114 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][57], [72#L1022-2true, 106#true, 26#L1022-1true, 33#L1035true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 129#true, 126#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,124 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,124 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,124 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,125 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][90], [34#L1022-1true, 106#true, 33#L1035true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 129#true, 126#(= |#race~ready~0| 0), 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,140 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,140 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,140 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,141 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,328 INFO L124 PetriNetUnfolderBase]: 382/2576 cut-off events. [2024-11-28 03:35:26,328 INFO L125 PetriNetUnfolderBase]: For 827/1116 co-relation queries the response was YES. [2024-11-28 03:35:26,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4116 conditions, 2576 events. 382/2576 cut-off events. For 827/1116 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 23490 event pairs, 43 based on Foata normal form. 25/2276 useless extension candidates. Maximal degree in co-relation 2474. Up to 353 conditions per place. [2024-11-28 03:35:26,345 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 16 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2024-11-28 03:35:26,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 127 transitions, 433 flow [2024-11-28 03:35:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2024-11-28 03:35:26,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2024-11-28 03:35:26,347 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 346 flow. Second operand 3 states and 300 transitions. [2024-11-28 03:35:26,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 127 transitions, 433 flow [2024-11-28 03:35:26,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:26,351 INFO L231 Difference]: Finished difference. Result has 113 places, 124 transitions, 402 flow [2024-11-28 03:35:26,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=113, PETRI_TRANSITIONS=124} [2024-11-28 03:35:26,352 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2024-11-28 03:35:26,352 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 124 transitions, 402 flow [2024-11-28 03:35:26,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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) [2024-11-28 03:35:26,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:26,352 INFO L206 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] [2024-11-28 03:35:26,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:35:26,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:26,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1266050810, now seen corresponding path program 1 times [2024-11-28 03:35:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893117289] [2024-11-28 03:35:26,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:26,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:26,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:26,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893117289] [2024-11-28 03:35:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893117289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:35:26,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157116086] [2024-11-28 03:35:26,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:26,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:35:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:26,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:35:26,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:35:26,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2024-11-28 03:35:26,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 124 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 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) [2024-11-28 03:35:26,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:26,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2024-11-28 03:35:26,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:26,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][100], [72#L1022-2true, 106#true, 26#L1022-1true, Black: 131#(= |#race~data~0| 0), 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 134#true, 129#true, 68#L1034-4true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,655 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,655 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,655 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,655 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][123], [34#L1022-1true, 106#true, Black: 131#(= |#race~data~0| 0), 104#true, 134#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 129#true, 68#L1034-4true, 81#L1022-2true, Black: 124#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2024-11-28 03:35:26,656 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,656 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,656 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:26,656 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:26,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][56], [72#L1022-2true, 106#true, 26#L1022-1true, Black: 131#(= |#race~data~0| 0), 33#L1035true, 104#true, 134#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 129#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,669 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,669 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,669 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,669 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][78], [34#L1022-1true, 106#true, Black: 131#(= |#race~data~0| 0), 33#L1035true, 104#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 134#true, 129#true, 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 124#true]) [2024-11-28 03:35:26,685 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,685 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,685 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:26,685 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:26,903 INFO L124 PetriNetUnfolderBase]: 363/2559 cut-off events. [2024-11-28 03:35:26,903 INFO L125 PetriNetUnfolderBase]: For 818/1035 co-relation queries the response was YES. [2024-11-28 03:35:26,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 2559 events. 363/2559 cut-off events. For 818/1035 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 23578 event pairs, 33 based on Foata normal form. 1/2310 useless extension candidates. Maximal degree in co-relation 3398. Up to 329 conditions per place. [2024-11-28 03:35:26,919 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 14 selfloop transitions, 2 changer transitions 5/130 dead transitions. [2024-11-28 03:35:26,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 456 flow [2024-11-28 03:35:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:35:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:35:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2024-11-28 03:35:26,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8501529051987767 [2024-11-28 03:35:26,921 INFO L175 Difference]: Start difference. First operand has 113 places, 124 transitions, 402 flow. Second operand 6 states and 556 transitions. [2024-11-28 03:35:26,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 456 flow [2024-11-28 03:35:26,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:26,926 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 410 flow [2024-11-28 03:35:26,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2024-11-28 03:35:26,927 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 15 predicate places. [2024-11-28 03:35:26,927 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 410 flow [2024-11-28 03:35:26,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 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) [2024-11-28 03:35:26,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:26,928 INFO L206 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] [2024-11-28 03:35:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:35:26,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:26,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1823687171, now seen corresponding path program 1 times [2024-11-28 03:35:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565517908] [2024-11-28 03:35:26,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:35:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:27,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565517908] [2024-11-28 03:35:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565517908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:27,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:35:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853874990] [2024-11-28 03:35:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:27,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:27,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:27,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:27,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 109 [2024-11-28 03:35:27,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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) [2024-11-28 03:35:27,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:27,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 109 [2024-11-28 03:35:27,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:27,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][78], [72#L1022-2true, 26#L1022-1true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 68#L1034-4true, Black: 124#true]) [2024-11-28 03:35:27,148 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:27,148 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:27,148 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:27,148 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:27,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->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: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 81#L1022-2true, Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 34#L1022-1true, 106#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 68#L1034-4true, Black: 124#true]) [2024-11-28 03:35:27,151 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-11-28 03:35:27,151 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2024-11-28 03:35:27,151 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:27,151 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2024-11-28 03:35:27,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-3-->L1022-1: Formula: (= |v_#race~ready~0_4| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_4|} AuxVars[] AssignedVars[#race~ready~0][40], [72#L1022-2true, 26#L1022-1true, 33#L1035true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 124#true]) [2024-11-28 03:35:27,163 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:27,163 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:27,163 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:27,163 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:27,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L1022-3-->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], [33#L1035true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 81#L1022-2true, Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 34#L1022-1true, 106#true, Black: 121#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), Black: 124#true]) [2024-11-28 03:35:27,174 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-11-28 03:35:27,174 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2024-11-28 03:35:27,174 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:27,174 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-11-28 03:35:27,277 INFO L124 PetriNetUnfolderBase]: 217/1432 cut-off events. [2024-11-28 03:35:27,277 INFO L125 PetriNetUnfolderBase]: For 355/473 co-relation queries the response was YES. [2024-11-28 03:35:27,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1432 events. 217/1432 cut-off events. For 355/473 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11176 event pairs, 34 based on Foata normal form. 9/1331 useless extension candidates. Maximal degree in co-relation 2338. Up to 214 conditions per place. [2024-11-28 03:35:27,286 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 6 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-11-28 03:35:27,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 368 flow [2024-11-28 03:35:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2024-11-28 03:35:27,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113149847094801 [2024-11-28 03:35:27,288 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 410 flow. Second operand 3 states and 298 transitions. [2024-11-28 03:35:27,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 368 flow [2024-11-28 03:35:27,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 346 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-28 03:35:27,294 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 340 flow [2024-11-28 03:35:27,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2024-11-28 03:35:27,295 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2024-11-28 03:35:27,295 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 340 flow [2024-11-28 03:35:27,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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) [2024-11-28 03:35:27,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:27,295 INFO L206 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] [2024-11-28 03:35:27,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:35:27,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-28 03:35:27,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:27,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1236972038, now seen corresponding path program 1 times [2024-11-28 03:35:27,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:27,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153710765] [2024-11-28 03:35:27,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:27,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:35:27,313 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:35:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:35:27,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:35:27,328 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:35:27,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2024-11-28 03:35:27,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-28 03:35:27,328 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-28 03:35:27,329 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-28 03:35:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:35:27,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:27,363 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-28 03:35:27,363 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:35:27,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:35:27 BasicIcfg [2024-11-28 03:35:27,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:35:27,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:35:27,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:35:27,370 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:35:27,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:35:21" (3/4) ... [2024-11-28 03:35:27,371 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:35:27,429 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 6. [2024-11-28 03:35:27,473 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:35:27,474 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:35:27,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:35:27,475 INFO L158 Benchmark]: Toolchain (without parser) took 7160.82ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 117.6MB in the beginning and 213.9MB in the end (delta: -96.3MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2024-11-28 03:35:27,475 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:35:27,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 633.45ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 90.3MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:35:27,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.00ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:35:27,476 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 87.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:35:27,476 INFO L158 Benchmark]: RCFGBuilder took 409.56ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 72.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:35:27,476 INFO L158 Benchmark]: TraceAbstraction took 5933.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 72.0MB in the beginning and 222.3MB in the end (delta: -150.3MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. [2024-11-28 03:35:27,477 INFO L158 Benchmark]: Witness Printer took 104.15ms. Allocated memory is still 394.3MB. Free memory was 222.3MB in the beginning and 213.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:35:27,478 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 142.6MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 633.45ms. Allocated memory is still 142.6MB. Free memory was 117.4MB in the beginning and 90.3MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.00ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 87.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 409.56ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 72.5MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5933.05ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 72.0MB in the beginning and 222.3MB in the end (delta: -150.3MB). Peak memory consumption was 101.1MB. Max. memory is 16.1GB. * Witness Printer took 104.15ms. Allocated memory is still 394.3MB. Free memory was 222.3MB in the beginning and 213.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1022]: Data race detected 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={-2:0}] [L1030] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1030] COND TRUE 0 i < threads_total VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0] [L1030] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1030] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1033] 0 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={-2:0}] [L1034] 0 ready = 1 VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(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: 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, 101 locations, 9 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.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 12 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 24, 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, 1.1s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 113 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.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 17 mSDtfsCounter, 303 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=410occurred in iteration=6, 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.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 03:35:27,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e7562d4-7d45-4634-9804-7ba42ec566ee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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(DATA-RACE)