./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX --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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:36:16,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:36:16,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 16:36:16,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:36:16,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:36:16,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:36:16,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:36:16,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:36:16,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:36:16,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:36:16,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:36:16,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:36:16,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:36:16,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:36:16,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:36:16,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:36:16,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:36:16,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:36:16,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:36:16,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:36:16,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:36:16,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:36:16,297 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 16:36:16,297 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:36:16,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:36:16,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:36:16,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:36:16,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:36:16,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:36:16,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:36:16,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:36:16,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:16,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:36:16,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:36:16,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:36:16,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:36:16,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:36:16,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:36:16,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:36:16,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:36:16,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:36:16,319 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX 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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2024-11-08 16:36:16,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:36:16,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:36:16,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:36:16,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:36:16,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:36:16,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i Unable to find full path for "g++" [2024-11-08 16:36:18,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:36:19,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:36:19,283 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-11-08 16:36:19,309 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/data/087fc81a7/a80deb5db0564a6185fc6b4a25f5ba80/FLAGfc31d6b8d [2024-11-08 16:36:19,481 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/data/087fc81a7/a80deb5db0564a6185fc6b4a25f5ba80 [2024-11-08 16:36:19,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:36:19,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:36:19,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:19,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:36:19,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:36:19,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:19" (1/1) ... [2024-11-08 16:36:19,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19133c02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:19, skipping insertion in model container [2024-11-08 16:36:19,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:19" (1/1) ... [2024-11-08 16:36:19,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:36:20,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:20,236 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:36:20,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:20,379 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:36:20,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20 WrapperNode [2024-11-08 16:36:20,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:20,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:20,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:36:20,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:36:20,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,468 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-11-08 16:36:20,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:20,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:36:20,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:36:20,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:36:20,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:36:20,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:36:20,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:36:20,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:36:20,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (1/1) ... [2024-11-08 16:36:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:20,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:20,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:36:20,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:36:20,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 16:36:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:36:20,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-08 16:36:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:36:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:36:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-08 16:36:20,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:36:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-08 16:36:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-08 16:36:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:36:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:36:20,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:36:20,628 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:36:20,822 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:36:20,824 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:36:21,271 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:36:21,271 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:36:21,331 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:36:21,332 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-08 16:36:21,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:21 BoogieIcfgContainer [2024-11-08 16:36:21,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:36:21,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:36:21,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:36:21,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:36:21,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:36:19" (1/3) ... [2024-11-08 16:36:21,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a865bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:21, skipping insertion in model container [2024-11-08 16:36:21,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:20" (2/3) ... [2024-11-08 16:36:21,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a865bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:21, skipping insertion in model container [2024-11-08 16:36:21,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:21" (3/3) ... [2024-11-08 16:36:21,347 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2024-11-08 16:36:21,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:36:21,363 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-08 16:36:21,363 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:36:21,444 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 16:36:21,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 163 transitions, 333 flow [2024-11-08 16:36:21,609 INFO L124 PetriNetUnfolderBase]: 25/234 cut-off events. [2024-11-08 16:36:21,609 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 16:36:21,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 234 events. 25/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 680 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 121. Up to 6 conditions per place. [2024-11-08 16:36:21,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 163 transitions, 333 flow [2024-11-08 16:36:21,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 163 transitions, 333 flow [2024-11-08 16:36:21,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:36:21,641 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;@2cc33f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:36:21,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-08 16:36:21,661 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:36:21,662 INFO L124 PetriNetUnfolderBase]: 4/67 cut-off events. [2024-11-08 16:36:21,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:36:21,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:21,663 INFO L204 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] [2024-11-08 16:36:21,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 16:36:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -107905595, now seen corresponding path program 1 times [2024-11-08 16:36:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286975770] [2024-11-08 16:36:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:22,943 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-08 16:36:22,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:22,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286975770] [2024-11-08 16:36:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286975770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:36:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17833493] [2024-11-08 16:36:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:22,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:36:22,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:23,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:36:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:36:23,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 163 [2024-11-08 16:36:23,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 163 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 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-08 16:36:23,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:23,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 163 [2024-11-08 16:36:23,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:23,629 INFO L124 PetriNetUnfolderBase]: 146/899 cut-off events. [2024-11-08 16:36:23,629 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-11-08 16:36:23,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 899 events. 146/899 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5485 event pairs, 60 based on Foata normal form. 86/868 useless extension candidates. Maximal degree in co-relation 1039. Up to 198 conditions per place. [2024-11-08 16:36:23,644 INFO L140 encePairwiseOnDemand]: 147/163 looper letters, 48 selfloop transitions, 5 changer transitions 0/174 dead transitions. [2024-11-08 16:36:23,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 174 transitions, 461 flow [2024-11-08 16:36:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:36:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:36:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2024-11-08 16:36:23,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384458077709611 [2024-11-08 16:36:23,672 INFO L175 Difference]: Start difference. First operand has 150 places, 163 transitions, 333 flow. Second operand 6 states and 820 transitions. [2024-11-08 16:36:23,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 174 transitions, 461 flow [2024-11-08 16:36:23,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 174 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:36:23,684 INFO L231 Difference]: Finished difference. Result has 152 places, 150 transitions, 317 flow [2024-11-08 16:36:23,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=152, PETRI_TRANSITIONS=150} [2024-11-08 16:36:23,691 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2024-11-08 16:36:23,691 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 150 transitions, 317 flow [2024-11-08 16:36:23,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 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-08 16:36:23,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:23,693 INFO L204 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] [2024-11-08 16:36:23,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:36:23,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 16:36:23,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1770173971, now seen corresponding path program 1 times [2024-11-08 16:36:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003981414] [2024-11-08 16:36:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:23,783 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-08 16:36:23,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003981414] [2024-11-08 16:36:23,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003981414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:23,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:23,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:36:23,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783632140] [2024-11-08 16:36:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:23,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:23,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:23,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:23,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:23,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 163 [2024-11-08 16:36:23,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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-08 16:36:23,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:23,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 163 [2024-11-08 16:36:23,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:23,975 INFO L124 PetriNetUnfolderBase]: 72/617 cut-off events. [2024-11-08 16:36:23,975 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-08 16:36:23,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 617 events. 72/617 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3063 event pairs, 0 based on Foata normal form. 2/552 useless extension candidates. Maximal degree in co-relation 680. Up to 103 conditions per place. [2024-11-08 16:36:23,981 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 23 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-11-08 16:36:23,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 156 transitions, 379 flow [2024-11-08 16:36:23,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2024-11-08 16:36:23,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8711656441717791 [2024-11-08 16:36:23,985 INFO L175 Difference]: Start difference. First operand has 152 places, 150 transitions, 317 flow. Second operand 3 states and 426 transitions. [2024-11-08 16:36:23,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 156 transitions, 379 flow [2024-11-08 16:36:23,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 156 transitions, 369 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 16:36:23,991 INFO L231 Difference]: Finished difference. Result has 150 places, 150 transitions, 317 flow [2024-11-08 16:36:23,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=317, PETRI_PLACES=150, PETRI_TRANSITIONS=150} [2024-11-08 16:36:23,993 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2024-11-08 16:36:23,993 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 150 transitions, 317 flow [2024-11-08 16:36:23,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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-08 16:36:23,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:23,994 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:23,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:36:23,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 16:36:23,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash 826704065, now seen corresponding path program 1 times [2024-11-08 16:36:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:23,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115821233] [2024-11-08 16:36:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:24,077 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-08 16:36:24,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:24,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115821233] [2024-11-08 16:36:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115821233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:24,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:24,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105619592] [2024-11-08 16:36:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:24,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:24,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:24,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:24,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2024-11-08 16:36:24,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 150 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 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-08 16:36:24,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:24,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2024-11-08 16:36:24,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:24,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][156], [130#L952-10true, Black: 161#(= |ULTIMATE.start_main_~i~1#1| 0), 159#true, 163#true, 150#true]) [2024-11-08 16:36:24,322 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2024-11-08 16:36:24,322 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2024-11-08 16:36:24,322 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2024-11-08 16:36:24,322 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-08 16:36:24,336 INFO L124 PetriNetUnfolderBase]: 150/973 cut-off events. [2024-11-08 16:36:24,337 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-08 16:36:24,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 973 events. 150/973 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6128 event pairs, 22 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 1175. Up to 128 conditions per place. [2024-11-08 16:36:24,346 INFO L140 encePairwiseOnDemand]: 154/163 looper letters, 30 selfloop transitions, 6 changer transitions 0/163 dead transitions. [2024-11-08 16:36:24,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 163 transitions, 418 flow [2024-11-08 16:36:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:24,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2024-11-08 16:36:24,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8711656441717791 [2024-11-08 16:36:24,349 INFO L175 Difference]: Start difference. First operand has 150 places, 150 transitions, 317 flow. Second operand 3 states and 426 transitions. [2024-11-08 16:36:24,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 163 transitions, 418 flow [2024-11-08 16:36:24,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 163 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:24,357 INFO L231 Difference]: Finished difference. Result has 150 places, 152 transitions, 351 flow [2024-11-08 16:36:24,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=150, PETRI_TRANSITIONS=152} [2024-11-08 16:36:24,361 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 0 predicate places. [2024-11-08 16:36:24,361 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 152 transitions, 351 flow [2024-11-08 16:36:24,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 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-08 16:36:24,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:24,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:24,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:36:24,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 16:36:24,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2072801734, now seen corresponding path program 1 times [2024-11-08 16:36:24,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:24,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107444441] [2024-11-08 16:36:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:24,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-08 16:36:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107444441] [2024-11-08 16:36:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107444441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:24,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136721040] [2024-11-08 16:36:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:24,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:24,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:24,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:24,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 163 [2024-11-08 16:36:24,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 152 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-08 16:36:24,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:24,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 163 [2024-11-08 16:36:24,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:24,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][155], [130#L952-10true, Black: 161#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 165#(= |#race~global~0| 0), 168#true, 163#true, 150#true]) [2024-11-08 16:36:24,682 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2024-11-08 16:36:24,682 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2024-11-08 16:36:24,682 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-08 16:36:24,683 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2024-11-08 16:36:24,695 INFO L124 PetriNetUnfolderBase]: 158/1022 cut-off events. [2024-11-08 16:36:24,695 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-11-08 16:36:24,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 1022 events. 158/1022 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6589 event pairs, 50 based on Foata normal form. 0/890 useless extension candidates. Maximal degree in co-relation 1320. Up to 220 conditions per place. [2024-11-08 16:36:24,702 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 27 selfloop transitions, 4 changer transitions 0/159 dead transitions. [2024-11-08 16:36:24,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 159 transitions, 431 flow [2024-11-08 16:36:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:24,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2024-11-08 16:36:24,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8629856850715747 [2024-11-08 16:36:24,705 INFO L175 Difference]: Start difference. First operand has 150 places, 152 transitions, 351 flow. Second operand 3 states and 422 transitions. [2024-11-08 16:36:24,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 159 transitions, 431 flow [2024-11-08 16:36:24,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 159 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:24,713 INFO L231 Difference]: Finished difference. Result has 152 places, 155 transitions, 371 flow [2024-11-08 16:36:24,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=152, PETRI_TRANSITIONS=155} [2024-11-08 16:36:24,714 INFO L277 CegarLoopForPetriNet]: 150 programPoint places, 2 predicate places. [2024-11-08 16:36:24,716 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 155 transitions, 371 flow [2024-11-08 16:36:24,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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-08 16:36:24,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:24,717 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:36:24,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-08 16:36:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 646512202, now seen corresponding path program 1 times [2024-11-08 16:36:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292107762] [2024-11-08 16:36:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:36:24,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:36:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:36:24,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:36:24,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:36:24,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-08 16:36:24,848 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-08 16:36:24,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-08 16:36:24,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-08 16:36:24,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-08 16:36:24,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-08 16:36:24,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-08 16:36:24,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-08 16:36:24,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-08 16:36:24,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-08 16:36:24,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-08 16:36:24,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-08 16:36:24,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:36:24,857 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 16:36:24,860 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 16:36:24,860 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-08 16:36:24,918 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-08 16:36:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 212 transitions, 440 flow [2024-11-08 16:36:24,994 INFO L124 PetriNetUnfolderBase]: 43/383 cut-off events. [2024-11-08 16:36:24,994 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-08 16:36:24,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 383 events. 43/383 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1301 event pairs, 0 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 236. Up to 9 conditions per place. [2024-11-08 16:36:24,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 212 transitions, 440 flow [2024-11-08 16:36:25,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 212 transitions, 440 flow [2024-11-08 16:36:25,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:36:25,009 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;@2cc33f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:36:25,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-08 16:36:25,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:36:25,020 INFO L124 PetriNetUnfolderBase]: 4/67 cut-off events. [2024-11-08 16:36:25,020 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:36:25,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:25,020 INFO L204 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] [2024-11-08 16:36:25,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash -987140839, now seen corresponding path program 1 times [2024-11-08 16:36:25,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:25,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168888695] [2024-11-08 16:36:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:25,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:25,553 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-08 16:36:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168888695] [2024-11-08 16:36:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168888695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:25,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:36:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989454308] [2024-11-08 16:36:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:25,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:36:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:36:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:36:25,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 212 [2024-11-08 16:36:25,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 212 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 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-08 16:36:25,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:25,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 212 [2024-11-08 16:36:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:27,548 INFO L124 PetriNetUnfolderBase]: 1971/8120 cut-off events. [2024-11-08 16:36:27,548 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2024-11-08 16:36:27,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11091 conditions, 8120 events. 1971/8120 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 83314 event pairs, 777 based on Foata normal form. 1276/8498 useless extension candidates. Maximal degree in co-relation 5351. Up to 2096 conditions per place. [2024-11-08 16:36:27,616 INFO L140 encePairwiseOnDemand]: 190/212 looper letters, 80 selfloop transitions, 5 changer transitions 0/241 dead transitions. [2024-11-08 16:36:27,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 241 transitions, 668 flow [2024-11-08 16:36:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:36:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:36:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1092 transitions. [2024-11-08 16:36:27,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8584905660377359 [2024-11-08 16:36:27,620 INFO L175 Difference]: Start difference. First operand has 194 places, 212 transitions, 440 flow. Second operand 6 states and 1092 transitions. [2024-11-08 16:36:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 241 transitions, 668 flow [2024-11-08 16:36:27,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 241 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:36:27,629 INFO L231 Difference]: Finished difference. Result has 196 places, 193 transitions, 412 flow [2024-11-08 16:36:27,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=196, PETRI_TRANSITIONS=193} [2024-11-08 16:36:27,631 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, 2 predicate places. [2024-11-08 16:36:27,633 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 193 transitions, 412 flow [2024-11-08 16:36:27,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 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-08 16:36:27,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:27,634 INFO L204 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] [2024-11-08 16:36:27,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:36:27,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:27,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash 283685395, now seen corresponding path program 1 times [2024-11-08 16:36:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:27,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365311797] [2024-11-08 16:36:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:27,697 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-08 16:36:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365311797] [2024-11-08 16:36:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365311797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:36:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766717779] [2024-11-08 16:36:27,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:27,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:27,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:27,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:27,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 212 [2024-11-08 16:36:27,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 193 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-08 16:36:27,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:27,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 212 [2024-11-08 16:36:27,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:28,908 INFO L124 PetriNetUnfolderBase]: 1017/4785 cut-off events. [2024-11-08 16:36:28,908 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-11-08 16:36:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6425 conditions, 4785 events. 1017/4785 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 45308 event pairs, 334 based on Foata normal form. 2/4283 useless extension candidates. Maximal degree in co-relation 831. Up to 1460 conditions per place. [2024-11-08 16:36:28,958 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 32 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-11-08 16:36:28,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 200 transitions, 496 flow [2024-11-08 16:36:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2024-11-08 16:36:28,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2024-11-08 16:36:28,961 INFO L175 Difference]: Start difference. First operand has 196 places, 193 transitions, 412 flow. Second operand 3 states and 540 transitions. [2024-11-08 16:36:28,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 200 transitions, 496 flow [2024-11-08 16:36:28,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 200 transitions, 484 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 16:36:28,966 INFO L231 Difference]: Finished difference. Result has 194 places, 194 transitions, 416 flow [2024-11-08 16:36:28,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=194, PETRI_TRANSITIONS=194} [2024-11-08 16:36:28,968 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, 0 predicate places. [2024-11-08 16:36:28,968 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 194 transitions, 416 flow [2024-11-08 16:36:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-08 16:36:28,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:28,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:36:28,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:28,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2072672272, now seen corresponding path program 1 times [2024-11-08 16:36:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:28,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663219469] [2024-11-08 16:36:28,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:28,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:29,022 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-08 16:36:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663219469] [2024-11-08 16:36:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663219469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553031962] [2024-11-08 16:36:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:29,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:29,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 212 [2024-11-08 16:36:29,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 194 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-08 16:36:29,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:29,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 212 [2024-11-08 16:36:29,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:32,269 INFO L124 PetriNetUnfolderBase]: 4873/15782 cut-off events. [2024-11-08 16:36:32,269 INFO L125 PetriNetUnfolderBase]: For 453/453 co-relation queries the response was YES. [2024-11-08 16:36:32,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23091 conditions, 15782 events. 4873/15782 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 175842 event pairs, 1605 based on Foata normal form. 0/13842 useless extension candidates. Maximal degree in co-relation 23029. Up to 3665 conditions per place. [2024-11-08 16:36:32,398 INFO L140 encePairwiseOnDemand]: 193/212 looper letters, 58 selfloop transitions, 14 changer transitions 0/227 dead transitions. [2024-11-08 16:36:32,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 227 transitions, 637 flow [2024-11-08 16:36:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2024-11-08 16:36:32,401 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8569182389937107 [2024-11-08 16:36:32,401 INFO L175 Difference]: Start difference. First operand has 194 places, 194 transitions, 416 flow. Second operand 3 states and 545 transitions. [2024-11-08 16:36:32,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 227 transitions, 637 flow [2024-11-08 16:36:32,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 227 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:36:32,407 INFO L231 Difference]: Finished difference. Result has 197 places, 208 transitions, 536 flow [2024-11-08 16:36:32,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=197, PETRI_TRANSITIONS=208} [2024-11-08 16:36:32,409 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, 3 predicate places. [2024-11-08 16:36:32,409 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 536 flow [2024-11-08 16:36:32,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-08 16:36:32,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:32,410 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:32,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:36:32,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:32,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 468491211, now seen corresponding path program 1 times [2024-11-08 16:36:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111766546] [2024-11-08 16:36:32,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:32,459 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-08 16:36:32,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:32,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111766546] [2024-11-08 16:36:32,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111766546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:32,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:32,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:32,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887358958] [2024-11-08 16:36:32,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:32,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:32,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:32,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:32,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 212 [2024-11-08 16:36:32,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-08 16:36:32,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:32,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 212 [2024-11-08 16:36:32,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:35,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 209#(= |#race~global~0| 0), 194#true, 162#L952-10true, 192#true, 207#true, Black: 205#(= |ULTIMATE.start_main_~i~1#1| 0), 212#true]) [2024-11-08 16:36:35,886 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2024-11-08 16:36:35,886 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-08 16:36:35,886 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-08 16:36:35,887 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-11-08 16:36:35,894 INFO L124 PetriNetUnfolderBase]: 5048/18796 cut-off events. [2024-11-08 16:36:35,894 INFO L125 PetriNetUnfolderBase]: For 4426/4599 co-relation queries the response was YES. [2024-11-08 16:36:35,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30178 conditions, 18796 events. 5048/18796 cut-off events. For 4426/4599 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 225647 event pairs, 2172 based on Foata normal form. 49/16668 useless extension candidates. Maximal degree in co-relation 15210. Up to 6070 conditions per place. [2024-11-08 16:36:36,034 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 52 selfloop transitions, 14 changer transitions 0/232 dead transitions. [2024-11-08 16:36:36,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 232 transitions, 754 flow [2024-11-08 16:36:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2024-11-08 16:36:36,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8474842767295597 [2024-11-08 16:36:36,037 INFO L175 Difference]: Start difference. First operand has 197 places, 208 transitions, 536 flow. Second operand 3 states and 539 transitions. [2024-11-08 16:36:36,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 232 transitions, 754 flow [2024-11-08 16:36:36,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 232 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:36,052 INFO L231 Difference]: Finished difference. Result has 199 places, 220 transitions, 634 flow [2024-11-08 16:36:36,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=199, PETRI_TRANSITIONS=220} [2024-11-08 16:36:36,054 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, 5 predicate places. [2024-11-08 16:36:36,054 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 220 transitions, 634 flow [2024-11-08 16:36:36,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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-08 16:36:36,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:36,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:36,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:36:36,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:36,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash -233099325, now seen corresponding path program 1 times [2024-11-08 16:36:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968004564] [2024-11-08 16:36:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968004564] [2024-11-08 16:36:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968004564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:36:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158908896] [2024-11-08 16:36:36,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:36,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:36,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:36,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:36,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:36:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:36,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:36:36,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:36,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:36:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158908896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:36:36,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:36:36,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 16:36:36,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874089323] [2024-11-08 16:36:36,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:36:36,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:36:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:36:36,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:36:36,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 212 [2024-11-08 16:36:36,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 220 transitions, 634 flow. Second operand has 10 states, 10 states have (on average 166.4) internal successors, (1664), 10 states have internal predecessors, (1664), 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-08 16:36:36,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:36,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 212 [2024-11-08 16:36:36,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:37,659 INFO L124 PetriNetUnfolderBase]: 969/4495 cut-off events. [2024-11-08 16:36:37,659 INFO L125 PetriNetUnfolderBase]: For 638/689 co-relation queries the response was YES. [2024-11-08 16:36:37,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7043 conditions, 4495 events. 969/4495 cut-off events. For 638/689 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 42927 event pairs, 55 based on Foata normal form. 214/4337 useless extension candidates. Maximal degree in co-relation 3342. Up to 709 conditions per place. [2024-11-08 16:36:37,699 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 75 selfloop transitions, 7 changer transitions 0/216 dead transitions. [2024-11-08 16:36:37,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 216 transitions, 742 flow [2024-11-08 16:36:37,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:36:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-08 16:36:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1562 transitions. [2024-11-08 16:36:37,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8186582809224319 [2024-11-08 16:36:37,805 INFO L175 Difference]: Start difference. First operand has 199 places, 220 transitions, 634 flow. Second operand 9 states and 1562 transitions. [2024-11-08 16:36:37,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 216 transitions, 742 flow [2024-11-08 16:36:37,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 216 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:37,814 INFO L231 Difference]: Finished difference. Result has 154 places, 158 transitions, 456 flow [2024-11-08 16:36:37,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=456, PETRI_PLACES=154, PETRI_TRANSITIONS=158} [2024-11-08 16:36:37,815 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -40 predicate places. [2024-11-08 16:36:37,815 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 158 transitions, 456 flow [2024-11-08 16:36:37,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.4) internal successors, (1664), 10 states have internal predecessors, (1664), 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-08 16:36:37,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:37,817 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:37,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:36:38,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b04395bc-17e4-4af1-ad8a-c9d5cba7e761/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:38,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:38,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash 638096793, now seen corresponding path program 1 times [2024-11-08 16:36:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:38,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309208309] [2024-11-08 16:36:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:38,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:38,105 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-08 16:36:38,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:38,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309208309] [2024-11-08 16:36:38,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309208309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:38,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:38,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:38,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679652862] [2024-11-08 16:36:38,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:38,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:38,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:38,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:38,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 212 [2024-11-08 16:36:38,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 158 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-08 16:36:38,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:38,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 212 [2024-11-08 16:36:38,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:38,438 INFO L124 PetriNetUnfolderBase]: 256/1247 cut-off events. [2024-11-08 16:36:38,438 INFO L125 PetriNetUnfolderBase]: For 529/560 co-relation queries the response was YES. [2024-11-08 16:36:38,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 1247 events. 256/1247 cut-off events. For 529/560 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8325 event pairs, 135 based on Foata normal form. 9/1176 useless extension candidates. Maximal degree in co-relation 2228. Up to 457 conditions per place. [2024-11-08 16:36:38,447 INFO L140 encePairwiseOnDemand]: 204/212 looper letters, 45 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2024-11-08 16:36:38,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 173 transitions, 625 flow [2024-11-08 16:36:38,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2024-11-08 16:36:38,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8270440251572327 [2024-11-08 16:36:38,449 INFO L175 Difference]: Start difference. First operand has 154 places, 158 transitions, 456 flow. Second operand 3 states and 526 transitions. [2024-11-08 16:36:38,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 173 transitions, 625 flow [2024-11-08 16:36:38,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 173 transitions, 610 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-08 16:36:38,456 INFO L231 Difference]: Finished difference. Result has 153 places, 166 transitions, 539 flow [2024-11-08 16:36:38,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=153, PETRI_TRANSITIONS=166} [2024-11-08 16:36:38,457 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -41 predicate places. [2024-11-08 16:36:38,457 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 166 transitions, 539 flow [2024-11-08 16:36:38,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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-08 16:36:38,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:38,458 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:36:38,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:36:38,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:38,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:38,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1998796224, now seen corresponding path program 1 times [2024-11-08 16:36:38,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:38,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716670447] [2024-11-08 16:36:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:38,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 16:36:38,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:38,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716670447] [2024-11-08 16:36:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716670447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:38,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:38,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:38,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652886769] [2024-11-08 16:36:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:38,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 212 [2024-11-08 16:36:38,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 166 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-08 16:36:38,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:38,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 212 [2024-11-08 16:36:38,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:38,903 INFO L124 PetriNetUnfolderBase]: 292/1415 cut-off events. [2024-11-08 16:36:38,903 INFO L125 PetriNetUnfolderBase]: For 1031/1056 co-relation queries the response was YES. [2024-11-08 16:36:38,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 1415 events. 292/1415 cut-off events. For 1031/1056 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9588 event pairs, 139 based on Foata normal form. 6/1332 useless extension candidates. Maximal degree in co-relation 2736. Up to 498 conditions per place. [2024-11-08 16:36:38,916 INFO L140 encePairwiseOnDemand]: 204/212 looper letters, 46 selfloop transitions, 14 changer transitions 0/180 dead transitions. [2024-11-08 16:36:38,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 180 transitions, 711 flow [2024-11-08 16:36:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2024-11-08 16:36:38,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8254716981132075 [2024-11-08 16:36:38,919 INFO L175 Difference]: Start difference. First operand has 153 places, 166 transitions, 539 flow. Second operand 3 states and 525 transitions. [2024-11-08 16:36:38,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 180 transitions, 711 flow [2024-11-08 16:36:38,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 180 transitions, 675 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:38,926 INFO L231 Difference]: Finished difference. Result has 155 places, 174 transitions, 617 flow [2024-11-08 16:36:38,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=155, PETRI_TRANSITIONS=174} [2024-11-08 16:36:38,927 INFO L277 CegarLoopForPetriNet]: 194 programPoint places, -39 predicate places. [2024-11-08 16:36:38,928 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 174 transitions, 617 flow [2024-11-08 16:36:38,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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-08 16:36:38,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:38,929 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:38,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:36:38,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:38,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1928588740, now seen corresponding path program 1 times [2024-11-08 16:36:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614261400] [2024-11-08 16:36:38,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:36:38,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:36:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:36:38,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:36:38,990 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:36:38,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-08 16:36:38,990 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-08 16:36:38,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-08 16:36:38,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-08 16:36:38,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-08 16:36:38,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-08 16:36:38,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-08 16:36:38,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-08 16:36:38,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-08 16:36:38,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-08 16:36:38,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:36:38,995 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:38,996 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 16:36:38,996 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-08 16:36:39,034 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 16:36:39,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 261 transitions, 549 flow [2024-11-08 16:36:39,157 INFO L124 PetriNetUnfolderBase]: 66/579 cut-off events. [2024-11-08 16:36:39,157 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-08 16:36:39,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 579 events. 66/579 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2150 event pairs, 1 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 391. Up to 16 conditions per place. [2024-11-08 16:36:39,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 261 transitions, 549 flow [2024-11-08 16:36:39,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 261 transitions, 549 flow [2024-11-08 16:36:39,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:36:39,171 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;@2cc33f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:36:39,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-08 16:36:39,181 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:36:39,181 INFO L124 PetriNetUnfolderBase]: 4/67 cut-off events. [2024-11-08 16:36:39,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:36:39,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:39,181 INFO L204 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] [2024-11-08 16:36:39,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-08 16:36:39,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash -712223810, now seen corresponding path program 1 times [2024-11-08 16:36:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:39,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086646046] [2024-11-08 16:36:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:39,706 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-08 16:36:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:39,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086646046] [2024-11-08 16:36:39,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086646046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:39,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:39,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:36:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479540581] [2024-11-08 16:36:39,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:39,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:36:39,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:36:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:36:39,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 261 [2024-11-08 16:36:39,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 261 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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-08 16:36:39,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:39,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 261 [2024-11-08 16:36:39,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:53,719 INFO L124 PetriNetUnfolderBase]: 20864/70056 cut-off events. [2024-11-08 16:36:53,719 INFO L125 PetriNetUnfolderBase]: For 1107/1109 co-relation queries the response was YES. [2024-11-08 16:36:53,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98663 conditions, 70056 events. 20864/70056 cut-off events. For 1107/1109 co-relation queries the response was YES. Maximal size of possible extension queue 1532. Compared 960945 event pairs, 6970 based on Foata normal form. 13397/76128 useless extension candidates. Maximal degree in co-relation 11571. Up to 20303 conditions per place. [2024-11-08 16:36:54,457 INFO L140 encePairwiseOnDemand]: 233/261 looper letters, 112 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2024-11-08 16:36:54,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 308 transitions, 877 flow [2024-11-08 16:36:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:36:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:36:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1364 transitions. [2024-11-08 16:36:54,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8710089399744572 [2024-11-08 16:36:54,463 INFO L175 Difference]: Start difference. First operand has 238 places, 261 transitions, 549 flow. Second operand 6 states and 1364 transitions. [2024-11-08 16:36:54,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 308 transitions, 877 flow [2024-11-08 16:36:54,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 308 transitions, 877 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:36:54,473 INFO L231 Difference]: Finished difference. Result has 240 places, 236 transitions, 509 flow [2024-11-08 16:36:54,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=240, PETRI_TRANSITIONS=236} [2024-11-08 16:36:54,475 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, 2 predicate places. [2024-11-08 16:36:54,475 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 236 transitions, 509 flow [2024-11-08 16:36:54,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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-08 16:36:54,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:54,477 INFO L204 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] [2024-11-08 16:36:54,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:36:54,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-08 16:36:54,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:54,478 INFO L85 PathProgramCache]: Analyzing trace with hash 216178963, now seen corresponding path program 1 times [2024-11-08 16:36:54,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069397400] [2024-11-08 16:36:54,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:54,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:54,531 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-08 16:36:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069397400] [2024-11-08 16:36:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069397400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:36:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420023031] [2024-11-08 16:36:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:54,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:54,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:54,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 261 [2024-11-08 16:36:54,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 236 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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-08 16:36:54,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:54,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 261 [2024-11-08 16:36:54,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:59,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][132], [235#true, 185#ULTIMATE.startFINALtrue, 247#true, 241#true, 6#L939-3true, 238#true, 237#true, 94#L939-3true]) [2024-11-08 16:36:59,991 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-08 16:36:59,991 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2024-11-08 16:36:59,992 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:36:59,992 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2024-11-08 16:37:00,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][132], [235#true, 185#ULTIMATE.startFINALtrue, 247#true, 241#true, 47#L939-16true, 238#true, 237#true, 94#L939-3true]) [2024-11-08 16:37:00,659 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-11-08 16:37:00,660 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-08 16:37:00,660 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-08 16:37:00,660 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-08 16:37:00,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][132], [235#true, 185#ULTIMATE.startFINALtrue, 247#true, 37#L939-22true, 241#true, 238#true, 237#true, 94#L939-3true]) [2024-11-08 16:37:00,743 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2024-11-08 16:37:00,743 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-08 16:37:00,743 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-08 16:37:00,743 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-11-08 16:37:00,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][132], [235#true, 185#ULTIMATE.startFINALtrue, 247#true, 49#L939-35true, 241#true, 238#true, 237#true, 94#L939-3true]) [2024-11-08 16:37:00,947 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-11-08 16:37:00,947 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-08 16:37:00,947 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-08 16:37:00,947 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-08 16:37:00,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L-1-2-->ULTIMATE.startFINAL: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret46#1=|v_ULTIMATE.start_main_#t~ret46#1_4|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_17|, ULTIMATE.start_main_#t~ret52#1=|v_ULTIMATE.start_main_#t~ret52#1_3|, ULTIMATE.start_main_#t~post54#1=|v_ULTIMATE.start_main_#t~post54#1_5|, ULTIMATE.start_main_#t~ret50#1=|v_ULTIMATE.start_main_#t~ret50#1_4|, ULTIMATE.start_main_#t~nondet44#1=|v_ULTIMATE.start_main_#t~nondet44#1_2|, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_3|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_17|, ULTIMATE.start_main_#t~ret48#1=|v_ULTIMATE.start_main_#t~ret48#1_4|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_6|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_9|, ULTIMATE.start_main_~#t_ids~0#1.base=|v_ULTIMATE.start_main_~#t_ids~0#1.base_19|, ULTIMATE.start_main_#t~ret49#1=|v_ULTIMATE.start_main_#t~ret49#1_4|, ULTIMATE.start_main_#t~nondet43#1=|v_ULTIMATE.start_main_#t~nondet43#1_9|, ULTIMATE.start_main_~#t_ids~0#1.offset=|v_ULTIMATE.start_main_~#t_ids~0#1.offset_19|, ULTIMATE.start_main_#t~ret51#1=|v_ULTIMATE.start_main_#t~ret51#1_4|, ULTIMATE.start_main_#t~post45#1=|v_ULTIMATE.start_main_#t~post45#1_5|, ULTIMATE.start_main_#t~pre42#1=|v_ULTIMATE.start_main_#t~pre42#1_4|, ULTIMATE.start_main_#t~ret47#1=|v_ULTIMATE.start_main_#t~ret47#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret46#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_#t~ret52#1, ULTIMATE.start_main_#t~post54#1, ULTIMATE.start_main_#t~ret50#1, ULTIMATE.start_main_#t~nondet44#1, ULTIMATE.start_main_#t~mem53#1, ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_#t~ret48#1, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#t_ids~0#1.base, ULTIMATE.start_main_#t~ret49#1, ULTIMATE.start_main_#t~nondet43#1, ULTIMATE.start_main_~#t_ids~0#1.offset, ULTIMATE.start_main_#t~ret51#1, ULTIMATE.start_main_#t~post45#1, ULTIMATE.start_main_#t~pre42#1, ULTIMATE.start_main_#t~ret47#1][132], [235#true, 185#ULTIMATE.startFINALtrue, 247#true, 241#true, 238#true, 237#true, 158#L940-2true, 94#L939-3true]) [2024-11-08 16:37:00,988 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-11-08 16:37:00,989 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-08 16:37:00,989 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-08 16:37:00,989 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-08 16:37:01,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1048] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][229], [235#true, 247#true, 236#true, 241#true, 238#true, 95#L952-10true, 94#L939-3true]) [2024-11-08 16:37:01,009 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2024-11-08 16:37:01,009 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:37:01,009 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:37:01,010 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:37:01,088 INFO L124 PetriNetUnfolderBase]: 11329/38693 cut-off events. [2024-11-08 16:37:01,088 INFO L125 PetriNetUnfolderBase]: For 2263/2263 co-relation queries the response was YES. [2024-11-08 16:37:01,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54823 conditions, 38693 events. 11329/38693 cut-off events. For 2263/2263 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 491492 event pairs, 8266 based on Foata normal form. 2/34755 useless extension candidates. Maximal degree in co-relation 40086. Up to 14957 conditions per place. [2024-11-08 16:37:01,404 INFO L140 encePairwiseOnDemand]: 257/261 looper letters, 40 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-11-08 16:37:01,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 243 transitions, 609 flow [2024-11-08 16:37:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:37:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:37:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2024-11-08 16:37:01,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8339719029374202 [2024-11-08 16:37:01,408 INFO L175 Difference]: Start difference. First operand has 240 places, 236 transitions, 509 flow. Second operand 3 states and 653 transitions. [2024-11-08 16:37:01,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 243 transitions, 609 flow [2024-11-08 16:37:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 243 transitions, 597 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 16:37:01,420 INFO L231 Difference]: Finished difference. Result has 238 places, 237 transitions, 513 flow [2024-11-08 16:37:01,420 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=238, PETRI_TRANSITIONS=237} [2024-11-08 16:37:01,421 INFO L277 CegarLoopForPetriNet]: 238 programPoint places, 0 predicate places. [2024-11-08 16:37:01,421 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 237 transitions, 513 flow [2024-11-08 16:37:01,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 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-08 16:37:01,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:37:01,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:01,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:37:01,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-08 16:37:01,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1847589279, now seen corresponding path program 1 times [2024-11-08 16:37:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:01,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696179596] [2024-11-08 16:37:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:01,467 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-08 16:37:01,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696179596] [2024-11-08 16:37:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696179596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:01,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:37:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580063286] [2024-11-08 16:37:01,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:01,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:37:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:37:01,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:37:01,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 261 [2024-11-08 16:37:01,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 237 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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-08 16:37:01,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:37:01,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 261 [2024-11-08 16:37:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:37:03,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [247#true, 236#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 234#true, 238#true, 95#L952-10true]) [2024-11-08 16:37:03,936 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2024-11-08 16:37:03,936 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2024-11-08 16:37:03,936 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-11-08 16:37:03,936 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2024-11-08 16:37:09,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [247#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 109#$Ultimate##0true, 234#true, 95#L952-10true, 237#true]) [2024-11-08 16:37:09,959 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-11-08 16:37:09,959 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-08 16:37:09,959 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-08 16:37:09,959 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-08 16:37:09,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [139#L938-3true, 247#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 234#true, 95#L952-10true, 237#true]) [2024-11-08 16:37:09,960 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-08 16:37:09,960 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-08 16:37:09,960 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 16:37:09,960 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 16:37:09,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1048] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][254], [235#true, 247#true, 236#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 66#$Ultimate##0true, 238#true, 95#L952-10true]) [2024-11-08 16:37:09,980 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-11-08 16:37:09,980 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-08 16:37:09,981 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-08 16:37:09,981 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-11-08 16:37:09,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1048] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][254], [235#true, 247#true, 236#true, 251#true, 70#L938-3true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 95#L952-10true]) [2024-11-08 16:37:09,981 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-08 16:37:09,981 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-08 16:37:09,981 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 16:37:09,981 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 16:37:12,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [247#true, 251#true, 6#L939-3true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 234#true, 95#L952-10true, 237#true]) [2024-11-08 16:37:12,564 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-08 16:37:12,565 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:37:12,565 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-08 16:37:12,565 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:37:12,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1048] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][254], [235#true, 247#true, 236#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 95#L952-10true, 94#L939-3true]) [2024-11-08 16:37:12,581 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-08 16:37:12,582 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:37:12,582 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:37:12,582 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-08 16:37:15,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [247#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 234#true, 127#L939-5true, 95#L952-10true, 237#true]) [2024-11-08 16:37:15,295 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-11-08 16:37:15,295 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-11-08 16:37:15,295 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-11-08 16:37:15,299 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-11-08 16:37:15,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [17#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 247#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 234#true, 95#L952-10true, 237#true]) [2024-11-08 16:37:15,299 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-11-08 16:37:15,299 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-08 16:37:15,300 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-08 16:37:15,300 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-08 16:37:15,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1047] t_funEXIT-->L952-10: Formula: (= v_t_funThread1of3ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_12|) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][202], [247#true, 251#true, 63#L939-6true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 234#true, 95#L952-10true, 237#true]) [2024-11-08 16:37:15,881 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-11-08 16:37:15,881 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-11-08 16:37:15,881 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-11-08 16:37:15,881 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-11-08 16:37:19,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1048] t_funEXIT-->L952-10: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_14| v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][254], [113#L939-10true, 235#true, 247#true, 236#true, 251#true, Black: 249#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 95#L952-10true]) [2024-11-08 16:37:19,220 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-11-08 16:37:19,220 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-08 16:37:19,221 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-11-08 16:37:19,221 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event