./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya --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 b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:46:13,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:46:13,306 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 03:46:13,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:46:13,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:46:13,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:46:13,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:46:13,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:46:13,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:46:13,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:46:13,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:46:13,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:46:13,341 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:46:13,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:46:13,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:46:13,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:46:13,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:46:13,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:46:13,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:46:13,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:46:13,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:46:13,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:46:13,346 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 03:46:13,346 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:46:13,347 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:46:13,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:46:13,348 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:46:13,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:46:13,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:46:13,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:46:13,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:46:13,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:46:13,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:46:13,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:46:13,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:46:13,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:46:13,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:46:13,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:46:13,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:46:13,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:46:13,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:46:13,352 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_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/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_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya 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 -> b3e7d0a2f10d1449a9a354d4032bafdd0ae7a7fd76aceb835acbee3134ec74e4 [2023-11-29 03:46:13,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:46:13,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:46:13,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:46:13,602 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:46:13,603 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:46:13,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2023-11-29 03:46:16,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:46:16,716 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:46:16,717 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/sv-benchmarks/c/goblint-regression/28-race_reach_02-simple_racefree.i [2023-11-29 03:46:16,736 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/data/b901e3bdf/760d4217fe734fd381d1ebd94822e949/FLAGe4cb8179a [2023-11-29 03:46:16,752 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/data/b901e3bdf/760d4217fe734fd381d1ebd94822e949 [2023-11-29 03:46:16,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:46:16,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:46:16,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:46:16,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:46:16,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:46:16,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:46:16" (1/1) ... [2023-11-29 03:46:16,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c397e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:16, skipping insertion in model container [2023-11-29 03:46:16,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:46:16" (1/1) ... [2023-11-29 03:46:16,820 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:46:17,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:46:17,239 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:46:17,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:46:17,333 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:46:17,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17 WrapperNode [2023-11-29 03:46:17,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:46:17,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:46:17,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:46:17,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:46:17,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,387 INFO L138 Inliner]: procedures = 171, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-11-29 03:46:17,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:46:17,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:46:17,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:46:17,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:46:17,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:46:17,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:46:17,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:46:17,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:46:17,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (1/1) ... [2023-11-29 03:46:17,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:46:17,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:46:17,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:46:17,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb7ed72a-0ba4-4c69-9c35-67fc46dd5577/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:46:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 03:46:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 03:46:17,507 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 03:46:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:46:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:46:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-29 03:46:17,508 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-29 03:46:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:46:17,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 03:46:17,509 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 03:46:17,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:46:17,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:46:17,510 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 03:46:17,662 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:46:17,664 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:46:17,940 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:46:17,983 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:46:17,983 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-29 03:46:17,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:46:17 BoogieIcfgContainer [2023-11-29 03:46:17,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:46:17,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:46:17,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:46:17,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:46:17,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:46:16" (1/3) ... [2023-11-29 03:46:17,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240a53fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:46:17, skipping insertion in model container [2023-11-29 03:46:17,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:46:17" (2/3) ... [2023-11-29 03:46:17,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240a53fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:46:17, skipping insertion in model container [2023-11-29 03:46:17,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:46:17" (3/3) ... [2023-11-29 03:46:17,997 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2023-11-29 03:46:18,007 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 03:46:18,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:46:18,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 03:46:18,021 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 03:46:18,093 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-29 03:46:18,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 147 transitions, 301 flow [2023-11-29 03:46:18,290 INFO L124 PetriNetUnfolderBase]: 19/200 cut-off events. [2023-11-29 03:46:18,290 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 03:46:18,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 200 events. 19/200 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 640 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-29 03:46:18,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 147 transitions, 301 flow [2023-11-29 03:46:18,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 147 transitions, 301 flow [2023-11-29 03:46:18,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:46:18,326 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35f681f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:46:18,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 03:46:18,346 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:46:18,346 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2023-11-29 03:46:18,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:46:18,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:18,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:18,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 03:46:18,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1063158675, now seen corresponding path program 1 times [2023-11-29 03:46:18,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:18,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276607975] [2023-11-29 03:46:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276607975] [2023-11-29 03:46:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276607975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:18,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:18,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:46:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874125515] [2023-11-29 03:46:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:18,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:18,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:18,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 147 [2023-11-29 03:46:18,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 147 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:18,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 147 [2023-11-29 03:46:18,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:46:18,972 INFO L124 PetriNetUnfolderBase]: 48/478 cut-off events. [2023-11-29 03:46:18,972 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 03:46:18,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 478 events. 48/478 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2192 event pairs, 28 based on Foata normal form. 65/495 useless extension candidates. Maximal degree in co-relation 524. Up to 108 conditions per place. [2023-11-29 03:46:18,980 INFO L140 encePairwiseOnDemand]: 132/147 looper letters, 22 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2023-11-29 03:46:18,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 331 flow [2023-11-29 03:46:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:46:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-29 03:46:19,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2023-11-29 03:46:19,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-29 03:46:19,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-29 03:46:19,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:46:19,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-29 03:46:19,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2023-11-29 03:46:19,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,027 INFO L175 Difference]: Start difference. First operand has 137 places, 147 transitions, 301 flow. Second operand 3 states and 392 transitions. [2023-11-29 03:46:19,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 331 flow [2023-11-29 03:46:19,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 03:46:19,039 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 279 flow [2023-11-29 03:46:19,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2023-11-29 03:46:19,047 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2023-11-29 03:46:19,047 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 279 flow [2023-11-29 03:46:19,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:19,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:19,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:46:19,049 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 03:46:19,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1481336055, now seen corresponding path program 1 times [2023-11-29 03:46:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590274722] [2023-11-29 03:46:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590274722] [2023-11-29 03:46:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590274722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:46:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478077381] [2023-11-29 03:46:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:19,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-11-29 03:46:19,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:19,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-11-29 03:46:19,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:46:19,362 INFO L124 PetriNetUnfolderBase]: 91/778 cut-off events. [2023-11-29 03:46:19,363 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 03:46:19,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 778 events. 91/778 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4547 event pairs, 27 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 952. Up to 125 conditions per place. [2023-11-29 03:46:19,369 INFO L140 encePairwiseOnDemand]: 138/147 looper letters, 30 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2023-11-29 03:46:19,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 380 flow [2023-11-29 03:46:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:46:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-29 03:46:19,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8435374149659864 [2023-11-29 03:46:19,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-29 03:46:19,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-29 03:46:19,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:46:19,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-29 03:46:19,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,380 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 279 flow. Second operand 3 states and 372 transitions. [2023-11-29 03:46:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 380 flow [2023-11-29 03:46:19,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:46:19,386 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 313 flow [2023-11-29 03:46:19,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2023-11-29 03:46:19,388 INFO L281 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2023-11-29 03:46:19,388 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 313 flow [2023-11-29 03:46:19,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:19,389 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-11-29 03:46:19,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:46:19,390 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2023-11-29 03:46:19,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -172459990, now seen corresponding path program 1 times [2023-11-29 03:46:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640264241] [2023-11-29 03:46:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:46:19,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:46:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:46:19,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:46:19,483 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:46:19,484 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-11-29 03:46:19,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2023-11-29 03:46:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2023-11-29 03:46:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2023-11-29 03:46:19,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2023-11-29 03:46:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2023-11-29 03:46:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2023-11-29 03:46:19,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2023-11-29 03:46:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2023-11-29 03:46:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2023-11-29 03:46:19,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2023-11-29 03:46:19,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:46:19,490 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 03:46:19,492 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 03:46:19,493 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 03:46:19,534 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 03:46:19,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 196 transitions, 408 flow [2023-11-29 03:46:19,585 INFO L124 PetriNetUnfolderBase]: 34/334 cut-off events. [2023-11-29 03:46:19,585 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 03:46:19,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 334 events. 34/334 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1241 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 202. Up to 8 conditions per place. [2023-11-29 03:46:19,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 196 transitions, 408 flow [2023-11-29 03:46:19,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 196 transitions, 408 flow [2023-11-29 03:46:19,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:46:19,598 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35f681f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:46:19,598 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-29 03:46:19,605 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:46:19,605 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2023-11-29 03:46:19,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:46:19,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:19,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:19,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 03:46:19,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1050209833, now seen corresponding path program 1 times [2023-11-29 03:46:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698451432] [2023-11-29 03:46:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:19,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:19,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698451432] [2023-11-29 03:46:19,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698451432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:19,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:19,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:46:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803521603] [2023-11-29 03:46:19,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:19,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:19,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 196 [2023-11-29 03:46:19,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 196 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:19,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:19,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 196 [2023-11-29 03:46:19,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:46:20,331 INFO L124 PetriNetUnfolderBase]: 788/4228 cut-off events. [2023-11-29 03:46:20,331 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-29 03:46:20,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5581 conditions, 4228 events. 788/4228 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 40404 event pairs, 348 based on Foata normal form. 749/4596 useless extension candidates. Maximal degree in co-relation 717. Up to 1303 conditions per place. [2023-11-29 03:46:20,371 INFO L140 encePairwiseOnDemand]: 175/196 looper letters, 31 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2023-11-29 03:46:20,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 182 transitions, 446 flow [2023-11-29 03:46:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:46:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-11-29 03:46:20,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2023-11-29 03:46:20,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-11-29 03:46:20,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-11-29 03:46:20,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:46:20,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-11-29 03:46:20,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:20,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:20,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:20,380 INFO L175 Difference]: Start difference. First operand has 181 places, 196 transitions, 408 flow. Second operand 3 states and 512 transitions. [2023-11-29 03:46:20,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 182 transitions, 446 flow [2023-11-29 03:46:20,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 182 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 03:46:20,385 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 378 flow [2023-11-29 03:46:20,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2023-11-29 03:46:20,387 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 0 predicate places. [2023-11-29 03:46:20,387 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 378 flow [2023-11-29 03:46:20,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:20,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:20,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:20,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:46:20,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 03:46:20,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash 848611384, now seen corresponding path program 1 times [2023-11-29 03:46:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859655464] [2023-11-29 03:46:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859655464] [2023-11-29 03:46:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859655464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:20,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:46:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212929308] [2023-11-29 03:46:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:20,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 196 [2023-11-29 03:46:20,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:20,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:20,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 196 [2023-11-29 03:46:20,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:46:22,583 INFO L124 PetriNetUnfolderBase]: 3893/14945 cut-off events. [2023-11-29 03:46:22,583 INFO L125 PetriNetUnfolderBase]: For 237/237 co-relation queries the response was YES. [2023-11-29 03:46:22,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21483 conditions, 14945 events. 3893/14945 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 170326 event pairs, 1530 based on Foata normal form. 0/13363 useless extension candidates. Maximal degree in co-relation 21427. Up to 3516 conditions per place. [2023-11-29 03:46:22,674 INFO L140 encePairwiseOnDemand]: 177/196 looper letters, 58 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2023-11-29 03:46:22,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 209 transitions, 599 flow [2023-11-29 03:46:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:46:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2023-11-29 03:46:22,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8350340136054422 [2023-11-29 03:46:22,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2023-11-29 03:46:22,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2023-11-29 03:46:22,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:46:22,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2023-11-29 03:46:22,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:22,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:22,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:22,684 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 378 flow. Second operand 3 states and 491 transitions. [2023-11-29 03:46:22,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 209 transitions, 599 flow [2023-11-29 03:46:22,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 209 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 03:46:22,691 INFO L231 Difference]: Finished difference. Result has 184 places, 190 transitions, 498 flow [2023-11-29 03:46:22,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=184, PETRI_TRANSITIONS=190} [2023-11-29 03:46:22,692 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2023-11-29 03:46:22,693 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 190 transitions, 498 flow [2023-11-29 03:46:22,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:22,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:22,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:22,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:46:22,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 03:46:22,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash 387016204, now seen corresponding path program 1 times [2023-11-29 03:46:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:22,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168460331] [2023-11-29 03:46:22,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:22,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168460331] [2023-11-29 03:46:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168460331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:46:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542555367] [2023-11-29 03:46:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:22,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:22,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:22,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:22,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2023-11-29 03:46:22,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 190 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:22,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:22,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2023-11-29 03:46:22,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:46:24,622 INFO L124 PetriNetUnfolderBase]: 4051/17149 cut-off events. [2023-11-29 03:46:24,622 INFO L125 PetriNetUnfolderBase]: For 4214/4381 co-relation queries the response was YES. [2023-11-29 03:46:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27925 conditions, 17149 events. 4051/17149 cut-off events. For 4214/4381 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 206662 event pairs, 2548 based on Foata normal form. 37/15583 useless extension candidates. Maximal degree in co-relation 26654. Up to 5551 conditions per place. [2023-11-29 03:46:24,694 INFO L140 encePairwiseOnDemand]: 187/196 looper letters, 52 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2023-11-29 03:46:24,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 214 transitions, 716 flow [2023-11-29 03:46:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:46:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-11-29 03:46:24,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8248299319727891 [2023-11-29 03:46:24,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-11-29 03:46:24,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-11-29 03:46:24,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:46:24,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-11-29 03:46:24,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:24,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:24,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:24,700 INFO L175 Difference]: Start difference. First operand has 184 places, 190 transitions, 498 flow. Second operand 3 states and 485 transitions. [2023-11-29 03:46:24,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 214 transitions, 716 flow [2023-11-29 03:46:24,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 214 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:46:24,716 INFO L231 Difference]: Finished difference. Result has 186 places, 202 transitions, 596 flow [2023-11-29 03:46:24,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=186, PETRI_TRANSITIONS=202} [2023-11-29 03:46:24,718 INFO L281 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2023-11-29 03:46:24,718 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 596 flow [2023-11-29 03:46:24,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:24,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:24,719 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2023-11-29 03:46:24,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:46:24,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2023-11-29 03:46:24,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1819485380, now seen corresponding path program 1 times [2023-11-29 03:46:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978743136] [2023-11-29 03:46:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:46:24,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:46:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:46:24,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:46:24,766 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-29 03:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-29 03:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-29 03:46:24,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-29 03:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-29 03:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-29 03:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-29 03:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-29 03:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-29 03:46:24,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-29 03:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-29 03:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-29 03:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-29 03:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-29 03:46:24,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-29 03:46:24,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:46:24,769 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-29 03:46:24,770 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 03:46:24,770 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 03:46:24,806 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 03:46:24,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 245 transitions, 517 flow [2023-11-29 03:46:24,880 INFO L124 PetriNetUnfolderBase]: 54/515 cut-off events. [2023-11-29 03:46:24,881 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-29 03:46:24,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 515 events. 54/515 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2091 event pairs, 1 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 342. Up to 16 conditions per place. [2023-11-29 03:46:24,884 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 245 transitions, 517 flow [2023-11-29 03:46:24,890 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 245 transitions, 517 flow [2023-11-29 03:46:24,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:46:24,892 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35f681f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:46:24,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-29 03:46:24,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 03:46:24,897 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2023-11-29 03:46:24,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 03:46:24,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:24,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:24,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 03:46:24,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:24,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1544436820, now seen corresponding path program 1 times [2023-11-29 03:46:24,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828227290] [2023-11-29 03:46:24,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828227290] [2023-11-29 03:46:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828227290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:46:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142195113] [2023-11-29 03:46:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:24,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:24,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:25,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 245 [2023-11-29 03:46:25,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 245 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:25,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:25,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 245 [2023-11-29 03:46:25,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:46:29,806 INFO L124 PetriNetUnfolderBase]: 8948/35200 cut-off events. [2023-11-29 03:46:29,807 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-11-29 03:46:29,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48438 conditions, 35200 events. 8948/35200 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 460228 event pairs, 5659 based on Foata normal form. 7660/39634 useless extension candidates. Maximal degree in co-relation 6247. Up to 12802 conditions per place. [2023-11-29 03:46:30,165 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 39 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2023-11-29 03:46:30,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 225 transitions, 559 flow [2023-11-29 03:46:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:46:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2023-11-29 03:46:30,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8585034013605443 [2023-11-29 03:46:30,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 631 transitions. [2023-11-29 03:46:30,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 631 transitions. [2023-11-29 03:46:30,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:46:30,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 631 transitions. [2023-11-29 03:46:30,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:30,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:30,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:30,180 INFO L175 Difference]: Start difference. First operand has 225 places, 245 transitions, 517 flow. Second operand 3 states and 631 transitions. [2023-11-29 03:46:30,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 225 transitions, 559 flow [2023-11-29 03:46:30,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 225 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 03:46:30,190 INFO L231 Difference]: Finished difference. Result has 225 places, 219 transitions, 475 flow [2023-11-29 03:46:30,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=225, PETRI_TRANSITIONS=219} [2023-11-29 03:46:30,192 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, 0 predicate places. [2023-11-29 03:46:30,192 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 219 transitions, 475 flow [2023-11-29 03:46:30,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:30,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:46:30,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:46:30,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 03:46:30,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1224832871, now seen corresponding path program 1 times [2023-11-29 03:46:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:46:30,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632238809] [2023-11-29 03:46:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:46:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:46:30,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632238809] [2023-11-29 03:46:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632238809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:30,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:30,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:46:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931534113] [2023-11-29 03:46:30,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:30,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:46:30,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:30,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:30,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 245 [2023-11-29 03:46:30,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 219 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:46:30,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:46:30,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 245 [2023-11-29 03:46:30,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:47:02,419 INFO L124 PetriNetUnfolderBase]: 108065/275214 cut-off events. [2023-11-29 03:47:02,419 INFO L125 PetriNetUnfolderBase]: For 6272/6272 co-relation queries the response was YES. [2023-11-29 03:47:03,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431173 conditions, 275214 events. 108065/275214 cut-off events. For 6272/6272 co-relation queries the response was YES. Maximal size of possible extension queue 5928. Compared 3994082 event pairs, 42388 based on Foata normal form. 0/244808 useless extension candidates. Maximal degree in co-relation 431116. Up to 82476 conditions per place. [2023-11-29 03:47:04,467 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 82 selfloop transitions, 20 changer transitions 0/266 dead transitions. [2023-11-29 03:47:04,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 266 transitions, 794 flow [2023-11-29 03:47:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:47:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:47:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2023-11-29 03:47:04,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8217687074829932 [2023-11-29 03:47:04,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2023-11-29 03:47:04,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2023-11-29 03:47:04,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:47:04,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2023-11-29 03:47:04,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:04,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:04,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:04,476 INFO L175 Difference]: Start difference. First operand has 225 places, 219 transitions, 475 flow. Second operand 3 states and 604 transitions. [2023-11-29 03:47:04,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 266 transitions, 794 flow [2023-11-29 03:47:04,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 266 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 03:47:04,487 INFO L231 Difference]: Finished difference. Result has 228 places, 239 transitions, 647 flow [2023-11-29 03:47:04,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=228, PETRI_TRANSITIONS=239} [2023-11-29 03:47:04,488 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, 3 predicate places. [2023-11-29 03:47:04,488 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 239 transitions, 647 flow [2023-11-29 03:47:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:04,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:47:04,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:47:04,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:47:04,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 03:47:04,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:47:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash 666253520, now seen corresponding path program 1 times [2023-11-29 03:47:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:47:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960500661] [2023-11-29 03:47:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:47:04,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:47:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:47:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:47:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:47:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960500661] [2023-11-29 03:47:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960500661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:47:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:47:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:47:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678330853] [2023-11-29 03:47:04,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:47:04,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:47:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:47:04,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:47:04,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:47:04,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 245 [2023-11-29 03:47:04,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 239 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:04,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:47:04,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 245 [2023-11-29 03:47:04,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:47:08,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, 65#L702-16true, t_funThread3of3ForFork0InUse, 233#true, 39#L709-6true, 107#L701-3true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 158#L702-10true]) [2023-11-29 03:47:08,776 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 03:47:08,776 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 03:47:08,776 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 03:47:08,776 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 03:47:09,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([943] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][182], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 235#(= |#race~global~0| 0), 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 107#L701-3true, 100#L702-6true, 239#true, 68#L702-24true, Black: 233#true, t_funThread1of3ForFork0InUse]) [2023-11-29 03:47:09,085 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,085 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,085 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,085 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,086 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([894] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][177], [t_funThread2of3ForFork0InUse, 65#L702-16true, t_funThread3of3ForFork0InUse, 235#(= |#race~global~0| 0), 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L702-6true, 239#true, t_funThread1of3ForFork0InUse, Black: 233#true, 119#L702-5true]) [2023-11-29 03:47:09,086 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,086 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,086 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,087 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:09,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 172#L702-22true, 39#L709-6true, 233#true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 107#L701-3true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 158#L702-10true]) [2023-11-29 03:47:09,956 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,956 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,956 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,957 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, 65#L702-16true, t_funThread3of3ForFork0InUse, 39#L709-6true, 233#true, 28#L702-3true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 158#L702-10true]) [2023-11-29 03:47:09,959 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,959 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,959 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 03:47:09,959 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-29 03:47:10,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([943] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][182], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 235#(= |#race~global~0| 0), 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 28#L702-3true, 100#L702-6true, 239#true, 68#L702-24true, Black: 233#true, t_funThread1of3ForFork0InUse]) [2023-11-29 03:47:10,503 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,503 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,503 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,503 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([894] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][177], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 235#(= |#race~global~0| 0), 172#L702-22true, 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 100#L702-6true, 239#true, Black: 233#true, t_funThread1of3ForFork0InUse, 119#L702-5true]) [2023-11-29 03:47:10,505 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,505 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,505 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 03:47:10,505 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2023-11-29 03:47:11,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][106], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 172#L702-22true, 39#L709-6true, 233#true, 28#L702-3true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 158#L702-10true]) [2023-11-29 03:47:11,565 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 03:47:11,565 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 03:47:11,565 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 03:47:11,565 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 03:47:45,044 INFO L124 PetriNetUnfolderBase]: 109071/321945 cut-off events. [2023-11-29 03:47:45,044 INFO L125 PetriNetUnfolderBase]: For 113211/119695 co-relation queries the response was YES. [2023-11-29 03:47:46,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582152 conditions, 321945 events. 109071/321945 cut-off events. For 113211/119695 co-relation queries the response was YES. Maximal size of possible extension queue 6706. Compared 5118954 event pairs, 67369 based on Foata normal form. 930/291886 useless extension candidates. Maximal degree in co-relation 552732. Up to 128767 conditions per place. [2023-11-29 03:47:47,809 INFO L140 encePairwiseOnDemand]: 232/245 looper letters, 76 selfloop transitions, 22 changer transitions 0/279 dead transitions. [2023-11-29 03:47:47,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 279 transitions, 995 flow [2023-11-29 03:47:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:47:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 03:47:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2023-11-29 03:47:47,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.819047619047619 [2023-11-29 03:47:47,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 602 transitions. [2023-11-29 03:47:47,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 602 transitions. [2023-11-29 03:47:47,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 03:47:47,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 602 transitions. [2023-11-29 03:47:47,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:47,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:47,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:47,816 INFO L175 Difference]: Start difference. First operand has 228 places, 239 transitions, 647 flow. Second operand 3 states and 602 transitions. [2023-11-29 03:47:47,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 279 transitions, 995 flow [2023-11-29 03:47:48,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 279 transitions, 937 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 03:47:48,024 INFO L231 Difference]: Finished difference. Result has 230 places, 259 transitions, 813 flow [2023-11-29 03:47:48,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=230, PETRI_TRANSITIONS=259} [2023-11-29 03:47:48,025 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, 5 predicate places. [2023-11-29 03:47:48,025 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 259 transitions, 813 flow [2023-11-29 03:47:48,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:48,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 03:47:48,026 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1] [2023-11-29 03:47:48,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:47:48,026 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2023-11-29 03:47:48,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:47:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash -279188281, now seen corresponding path program 1 times [2023-11-29 03:47:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:47:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814654369] [2023-11-29 03:47:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:47:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:47:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:47:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:47:48,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:47:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814654369] [2023-11-29 03:47:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814654369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:47:48,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:47:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:47:48,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636396862] [2023-11-29 03:47:48,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:47:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:47:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:47:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:47:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:47:48,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 245 [2023-11-29 03:47:48,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 259 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:47:48,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 03:47:48,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 245 [2023-11-29 03:47:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 03:47:51,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][189], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 247#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 39#L709-6true, 107#L701-3true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 158#L702-10true]) [2023-11-29 03:47:51,156 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 03:47:51,156 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 03:47:51,156 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 03:47:51,156 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 03:47:52,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L702-9-->L702-10: Formula: (= |v_t_funThread2of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|} OutVars{t_funThread2of3ForFork0_#t~nondet6=|v_t_funThread2of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][189], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 247#(= |#race~global~0| |t_funThread2of3ForFork0_#t~nondet6|), 99#L702-11true, 39#L709-6true, 28#L702-3true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse, 158#L702-10true]) [2023-11-29 03:47:52,544 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-29 03:47:52,544 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 03:47:52,544 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 03:47:52,545 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-29 03:47:53,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([894] L702-4-->L702-5: Formula: (= |v_#race~global~0_4| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_4|} AuxVars[] AssignedVars[#race~global~0][248], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 118#L702-9true, 239#true, t_funThread1of3ForFork0InUse, Black: 233#true, 119#L702-5true]) [2023-11-29 03:47:53,034 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2023-11-29 03:47:53,034 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:53,035 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:53,035 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-29 03:47:59,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][236], [t_funThread2of3ForFork0InUse, 130#L702-10true, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 179#L702-16true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse]) [2023-11-29 03:47:59,838 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-29 03:47:59,838 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 03:47:59,838 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 03:47:59,838 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 03:47:59,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][236], [214#L702-22true, 130#L702-10true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse]) [2023-11-29 03:47:59,839 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-29 03:47:59,839 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 03:47:59,839 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 03:47:59,839 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 03:47:59,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][281], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 181#L702-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 233#true, 209#L702-24true, t_funThread1of3ForFork0InUse]) [2023-11-29 03:47:59,842 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,842 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,842 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,842 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][281], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, 218#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 233#true, 209#L702-24true, t_funThread1of3ForFork0InUse]) [2023-11-29 03:47:59,845 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,845 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,845 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:47:59,845 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:48:01,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][211], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 161#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, 218#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 209#L702-24true, t_funThread1of3ForFork0InUse, Black: 233#true]) [2023-11-29 03:48:01,552 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2023-11-29 03:48:01,552 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:48:01,552 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:48:01,552 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-29 03:48:01,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][172], [130#L702-10true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 161#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 179#L702-16true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse]) [2023-11-29 03:48:01,625 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2023-11-29 03:48:01,625 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-29 03:48:01,625 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-29 03:48:01,625 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2023-11-29 03:48:02,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][233], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 218#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 239#true, 209#L702-24true, Black: 233#true, t_funThread1of3ForFork0InUse]) [2023-11-29 03:48:02,636 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,636 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,636 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,636 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][211], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 161#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 181#L702-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, t_funThread1of3ForFork0InUse, Black: 233#true, 209#L702-24true]) [2023-11-29 03:48:02,654 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,654 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,654 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2023-11-29 03:48:02,654 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2023-11-29 03:48:03,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] L702-9-->L702-10: Formula: (= |v_t_funThread3of3ForFork0_#t~nondet6_3| |v_#race~global~0_7|) InVars {t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|} OutVars{t_funThread3of3ForFork0_#t~nondet6=|v_t_funThread3of3ForFork0_#t~nondet6_3|, #race~global~0=|v_#race~global~0_7|} AuxVars[] AssignedVars[#race~global~0][172], [130#L702-10true, 214#L702-22true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 161#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse]) [2023-11-29 03:48:03,774 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-29 03:48:03,774 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 03:48:03,774 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 03:48:03,774 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-29 03:48:13,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L702-28-->L702-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][287], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 179#L702-16true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 99#L702-11true, 195#L702-29true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse]) [2023-11-29 03:48:13,707 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-29 03:48:13,707 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 03:48:13,707 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 03:48:13,707 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-29 03:48:13,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][281], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 156#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, t_funThread1of3ForFork0InUse, 209#L702-24true, Black: 233#true]) [2023-11-29 03:48:13,717 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,717 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,717 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,717 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][281], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 99#L702-11true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 103#L702-25true, 245#true, 239#true, 209#L702-24true, Black: 233#true, t_funThread1of3ForFork0InUse]) [2023-11-29 03:48:13,727 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,727 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,727 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 03:48:13,727 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 03:48:16,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L702-23-->L702-24: Formula: (= |v_#race~global~0_10| 0) InVars {} OutVars{#race~global~0=|v_#race~global~0_10|} AuxVars[] AssignedVars[#race~global~0][211], [t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 161#t_funErr1ASSERT_VIOLATIONDATA_RACEtrue, 156#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 39#L709-6true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, 209#L702-24true, t_funThread1of3ForFork0InUse, Black: 233#true]) [2023-11-29 03:48:16,377 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2023-11-29 03:48:16,377 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2023-11-29 03:48:16,377 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2023-11-29 03:48:16,377 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2023-11-29 03:48:16,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] L702-28-->L702-29: Formula: (= |v_#race~global~0_13| |v_t_funThread3of3ForFork0_#t~nondet10_3|) InVars {t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|} OutVars{t_funThread3of3ForFork0_#t~nondet10=|v_t_funThread3of3ForFork0_#t~nondet10_3|, #race~global~0=|v_#race~global~0_13|} AuxVars[] AssignedVars[#race~global~0][287], [214#L702-22true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, Black: 241#(= |t_funThread1of3ForFork0_#t~nondet6| |#race~global~0|), 99#L702-11true, 74#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 195#L702-29true, Black: 230#(= |ULTIMATE.start_main_~i~0#1| 0), 245#true, 239#true, Black: 235#(= |#race~global~0| 0), t_funThread1of3ForFork0InUse]) [2023-11-29 03:48:16,498 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2023-11-29 03:48:16,498 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 03:48:16,498 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 03:48:16,498 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event