./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:18:51,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:18:52,059 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 22:18:52,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:18:52,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:18:52,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:18:52,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:18:52,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:18:52,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:18:52,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:18:52,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:18:52,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:18:52,096 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:18:52,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:18:52,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:18:52,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:18:52,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:18:52,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:18:52,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:18:52,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:18:52,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:18:52,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:18:52,102 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:18:52,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:18:52,103 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:18:52,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:18:52,104 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:18:52,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:18:52,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:18:52,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:18:52,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:18:52,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:18:52,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:18:52,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:18:52,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:18:52,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:18:52,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:18:52,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:18:52,109 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:18:52,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:18:52,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:18:52,111 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ca8ac8d2a0a0bfcebfb7f99229747142c166641dd0f1bf091ac2b4ae67e9ee75 [2023-11-21 22:18:52,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:18:52,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:18:52,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:18:52,455 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:18:52,455 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:18:52,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-21 22:18:55,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:18:56,127 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:18:56,128 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/sv-benchmarks/c/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-11-21 22:18:56,152 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/data/93bb34c5c/d765163415c245b8a92843b7361aec7a/FLAG31c6d3ac8 [2023-11-21 22:18:56,168 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/data/93bb34c5c/d765163415c245b8a92843b7361aec7a [2023-11-21 22:18:56,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:18:56,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:18:56,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:18:56,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:18:56,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:18:56,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcde810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56, skipping insertion in model container [2023-11-21 22:18:56,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,251 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:18:56,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:18:56,695 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:18:56,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:18:56,800 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:18:56,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56 WrapperNode [2023-11-21 22:18:56,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:18:56,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:18:56,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:18:56,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:18:56,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,875 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 209 [2023-11-21 22:18:56,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:18:56,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:18:56,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:18:56,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:18:56,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:18:56,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:18:56,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:18:56,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:18:56,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (1/1) ... [2023-11-21 22:18:56,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:18:56,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:18:56,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:18:56,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:18:57,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:18:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:18:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 22:18:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:18:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:18:57,012 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-21 22:18:57,013 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-21 22:18:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:18:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:18:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 22:18:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:18:57,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:18:57,014 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:18:57,147 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:18:57,150 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:18:57,579 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:18:57,636 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:18:57,636 INFO L308 CfgBuilder]: Removed 18 assume(true) statements. [2023-11-21 22:18:57,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:57 BoogieIcfgContainer [2023-11-21 22:18:57,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:18:57,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:18:57,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:18:57,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:18:57,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:18:56" (1/3) ... [2023-11-21 22:18:57,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331dcf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:18:57, skipping insertion in model container [2023-11-21 22:18:57,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:18:56" (2/3) ... [2023-11-21 22:18:57,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331dcf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:18:57, skipping insertion in model container [2023-11-21 22:18:57,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:18:57" (3/3) ... [2023-11-21 22:18:57,649 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2023-11-21 22:18:57,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:18:57,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:18:57,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-21 22:18:57,667 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:18:57,747 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:18:57,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 208 transitions, 423 flow [2023-11-21 22:18:57,920 INFO L124 PetriNetUnfolderBase]: 36/301 cut-off events. [2023-11-21 22:18:57,921 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-21 22:18:57,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 301 events. 36/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1356 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 176. Up to 6 conditions per place. [2023-11-21 22:18:57,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 208 transitions, 423 flow [2023-11-21 22:18:57,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 208 transitions, 423 flow [2023-11-21 22:18:57,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:18:57,983 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;@7e54bc24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:18:57,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-21 22:18:58,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:18:58,010 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-11-21 22:18:58,011 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:18:58,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:18:58,012 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] [2023-11-21 22:18:58,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 22:18:58,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash -940027554, now seen corresponding path program 1 times [2023-11-21 22:18:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:58,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572783276] [2023-11-21 22:18:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:58,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:58,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572783276] [2023-11-21 22:18:58,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572783276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:58,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:58,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:18:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181989018] [2023-11-21 22:18:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:58,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:18:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:58,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:18:58,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:18:58,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 208 [2023-11-21 22:18:58,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 208 transitions, 423 flow. Second operand has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:58,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:18:58,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 208 [2023-11-21 22:18:58,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:18:58,702 INFO L124 PetriNetUnfolderBase]: 82/842 cut-off events. [2023-11-21 22:18:58,702 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-21 22:18:58,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 842 events. 82/842 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5126 event pairs, 72 based on Foata normal form. 153/890 useless extension candidates. Maximal degree in co-relation 893. Up to 172 conditions per place. [2023-11-21 22:18:58,712 INFO L140 encePairwiseOnDemand]: 186/208 looper letters, 19 selfloop transitions, 0 changer transitions 0/180 dead transitions. [2023-11-21 22:18:58,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 180 transitions, 405 flow [2023-11-21 22:18:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:18:58,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-21 22:18:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 371 transitions. [2023-11-21 22:18:58,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8918269230769231 [2023-11-21 22:18:58,733 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 371 transitions. [2023-11-21 22:18:58,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 371 transitions. [2023-11-21 22:18:58,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:58,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 371 transitions. [2023-11-21 22:18:58,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:58,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:58,752 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:58,754 INFO L175 Difference]: Start difference. First operand has 187 places, 208 transitions, 423 flow. Second operand 2 states and 371 transitions. [2023-11-21 22:18:58,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 180 transitions, 405 flow [2023-11-21 22:18:58,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 180 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:18:58,786 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 367 flow [2023-11-21 22:18:58,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=367, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2023-11-21 22:18:58,793 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, -5 predicate places. [2023-11-21 22:18:58,794 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 367 flow [2023-11-21 22:18:58,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:58,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:18:58,795 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] [2023-11-21 22:18:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:18:58,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 22:18:58,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -937266551, now seen corresponding path program 1 times [2023-11-21 22:18:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386076907] [2023-11-21 22:18:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386076907] [2023-11-21 22:18:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386076907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:58,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:18:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381965302] [2023-11-21 22:18:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:58,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:18:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:58,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:18:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:18:59,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 208 [2023-11-21 22:18:59,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:59,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:18:59,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 208 [2023-11-21 22:18:59,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:18:59,291 INFO L124 PetriNetUnfolderBase]: 110/1038 cut-off events. [2023-11-21 22:18:59,292 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-21 22:18:59,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 1038 events. 110/1038 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6564 event pairs, 88 based on Foata normal form. 1/927 useless extension candidates. Maximal degree in co-relation 1283. Up to 232 conditions per place. [2023-11-21 22:18:59,302 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 32 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-11-21 22:18:59,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 189 transitions, 453 flow [2023-11-21 22:18:59,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:18:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:18:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-11-21 22:18:59,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2023-11-21 22:18:59,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-11-21 22:18:59,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-11-21 22:18:59,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:18:59,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-11-21 22:18:59,313 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-21 22:18:59,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:59,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:59,319 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 367 flow. Second operand 3 states and 512 transitions. [2023-11-21 22:18:59,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 189 transitions, 453 flow [2023-11-21 22:18:59,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:18:59,329 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 375 flow [2023-11-21 22:18:59,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2023-11-21 22:18:59,330 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, -2 predicate places. [2023-11-21 22:18:59,331 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 375 flow [2023-11-21 22:18:59,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:59,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:18:59,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:18:59,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:18:59,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 22:18:59,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:18:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1051888379, now seen corresponding path program 1 times [2023-11-21 22:18:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:18:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182658642] [2023-11-21 22:18:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:18:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:18:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:18:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:18:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:18:59,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182658642] [2023-11-21 22:18:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182658642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:18:59,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:18:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:18:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992214849] [2023-11-21 22:18:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:18:59,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:18:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:18:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:18:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:18:59,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 208 [2023-11-21 22:18:59,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:18:59,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:18:59,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 208 [2023-11-21 22:18:59,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:19:00,043 INFO L124 PetriNetUnfolderBase]: 442/2612 cut-off events. [2023-11-21 22:19:00,043 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-21 22:19:00,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 2612 events. 442/2612 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 21152 event pairs, 174 based on Foata normal form. 0/2367 useless extension candidates. Maximal degree in co-relation 3592. Up to 608 conditions per place. [2023-11-21 22:19:00,064 INFO L140 encePairwiseOnDemand]: 183/208 looper letters, 62 selfloop transitions, 18 changer transitions 0/216 dead transitions. [2023-11-21 22:19:00,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 216 transitions, 610 flow [2023-11-21 22:19:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:19:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-21 22:19:00,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8125 [2023-11-21 22:19:00,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-21 22:19:00,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-21 22:19:00,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:19:00,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-21 22:19:00,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:00,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:00,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:00,073 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 375 flow. Second operand 3 states and 507 transitions. [2023-11-21 22:19:00,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 216 transitions, 610 flow [2023-11-21 22:19:00,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 216 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:19:00,083 INFO L231 Difference]: Finished difference. Result has 187 places, 198 transitions, 529 flow [2023-11-21 22:19:00,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=187, PETRI_TRANSITIONS=198} [2023-11-21 22:19:00,085 INFO L281 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2023-11-21 22:19:00,085 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 198 transitions, 529 flow [2023-11-21 22:19:00,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:00,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:19:00,087 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] [2023-11-21 22:19:00,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:19:00,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2023-11-21 22:19:00,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1990133874, now seen corresponding path program 1 times [2023-11-21 22:19:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895762089] [2023-11-21 22:19:00,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:00,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:19:00,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:19:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:19:00,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:19:00,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:19:00,212 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2023-11-21 22:19:00,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-11-21 22:19:00,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-11-21 22:19:00,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-11-21 22:19:00,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-11-21 22:19:00,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2023-11-21 22:19:00,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-11-21 22:19:00,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-11-21 22:19:00,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-11-21 22:19:00,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-11-21 22:19:00,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-11-21 22:19:00,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2023-11-21 22:19:00,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-11-21 22:19:00,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-11-21 22:19:00,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2023-11-21 22:19:00,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-11-21 22:19:00,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-11-21 22:19:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-11-21 22:19:00,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-11-21 22:19:00,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:19:00,229 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 22:19:00,233 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:19:00,233 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:19:00,307 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:19:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 257 places, 288 transitions, 592 flow [2023-11-21 22:19:00,429 INFO L124 PetriNetUnfolderBase]: 62/506 cut-off events. [2023-11-21 22:19:00,429 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-21 22:19:00,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 506 events. 62/506 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2531 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 303. Up to 9 conditions per place. [2023-11-21 22:19:00,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 257 places, 288 transitions, 592 flow [2023-11-21 22:19:00,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 288 transitions, 592 flow [2023-11-21 22:19:00,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:19:00,459 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;@7e54bc24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:19:00,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-21 22:19:00,471 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:19:00,471 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-11-21 22:19:00,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:19:00,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:19:00,472 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] [2023-11-21 22:19:00,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-21 22:19:00,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 162706782, now seen corresponding path program 1 times [2023-11-21 22:19:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:00,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717128187] [2023-11-21 22:19:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:00,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717128187] [2023-11-21 22:19:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717128187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:00,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:19:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284773305] [2023-11-21 22:19:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:00,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:19:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:19:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:19:00,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 288 [2023-11-21 22:19:00,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 288 transitions, 592 flow. Second operand has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:00,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:19:00,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 288 [2023-11-21 22:19:00,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:19:02,330 INFO L124 PetriNetUnfolderBase]: 1733/9092 cut-off events. [2023-11-21 22:19:02,334 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-11-21 22:19:02,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 9092 events. 1733/9092 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 101466 event pairs, 1620 based on Foata normal form. 2257/10230 useless extension candidates. Maximal degree in co-relation 10594. Up to 2642 conditions per place. [2023-11-21 22:19:02,435 INFO L140 encePairwiseOnDemand]: 256/288 looper letters, 30 selfloop transitions, 0 changer transitions 0/247 dead transitions. [2023-11-21 22:19:02,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 247 transitions, 570 flow [2023-11-21 22:19:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:19:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-21 22:19:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 508 transitions. [2023-11-21 22:19:02,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8819444444444444 [2023-11-21 22:19:02,439 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 508 transitions. [2023-11-21 22:19:02,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 508 transitions. [2023-11-21 22:19:02,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:19:02,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 508 transitions. [2023-11-21 22:19:02,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 254.0) internal successors, (508), 2 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:02,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:02,449 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:02,449 INFO L175 Difference]: Start difference. First operand has 257 places, 288 transitions, 592 flow. Second operand 2 states and 508 transitions. [2023-11-21 22:19:02,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 247 transitions, 570 flow [2023-11-21 22:19:02,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 247 transitions, 570 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:19:02,457 INFO L231 Difference]: Finished difference. Result has 249 places, 247 transitions, 510 flow [2023-11-21 22:19:02,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=510, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2023-11-21 22:19:02,459 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -8 predicate places. [2023-11-21 22:19:02,459 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 510 flow [2023-11-21 22:19:02,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 224.5) internal successors, (449), 2 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:02,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:19:02,460 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] [2023-11-21 22:19:02,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:19:02,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-21 22:19:02,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash 165467785, now seen corresponding path program 1 times [2023-11-21 22:19:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:02,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299996714] [2023-11-21 22:19:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:02,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:02,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299996714] [2023-11-21 22:19:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299996714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:19:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558271725] [2023-11-21 22:19:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:02,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:02,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:02,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:02,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 288 [2023-11-21 22:19:02,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:02,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:19:02,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 288 [2023-11-21 22:19:02,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:19:04,637 INFO L124 PetriNetUnfolderBase]: 2529/12684 cut-off events. [2023-11-21 22:19:04,638 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-11-21 22:19:04,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16593 conditions, 12684 events. 2529/12684 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 148652 event pairs, 1098 based on Foata normal form. 1/11258 useless extension candidates. Maximal degree in co-relation 16588. Up to 3840 conditions per place. [2023-11-21 22:19:04,837 INFO L140 encePairwiseOnDemand]: 285/288 looper letters, 44 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2023-11-21 22:19:04,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 257 transitions, 622 flow [2023-11-21 22:19:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:19:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2023-11-21 22:19:04,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8078703703703703 [2023-11-21 22:19:04,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2023-11-21 22:19:04,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2023-11-21 22:19:04,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:19:04,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2023-11-21 22:19:04,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:04,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:04,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:04,850 INFO L175 Difference]: Start difference. First operand has 249 places, 247 transitions, 510 flow. Second operand 3 states and 698 transitions. [2023-11-21 22:19:04,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 257 transitions, 622 flow [2023-11-21 22:19:04,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 22:19:04,859 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 522 flow [2023-11-21 22:19:04,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2023-11-21 22:19:04,860 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -5 predicate places. [2023-11-21 22:19:04,861 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 522 flow [2023-11-21 22:19:04,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:04,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:19:04,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:19:04,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:19:04,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-21 22:19:04,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1184978803, now seen corresponding path program 1 times [2023-11-21 22:19:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094855931] [2023-11-21 22:19:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:04,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094855931] [2023-11-21 22:19:04,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094855931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:04,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:04,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:19:04,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569792031] [2023-11-21 22:19:04,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:04,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:04,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:04,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:04,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:04,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 288 [2023-11-21 22:19:04,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:04,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:19:04,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 288 [2023-11-21 22:19:04,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:19:16,264 INFO L124 PetriNetUnfolderBase]: 26162/86102 cut-off events. [2023-11-21 22:19:16,264 INFO L125 PetriNetUnfolderBase]: For 549/549 co-relation queries the response was YES. [2023-11-21 22:19:16,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128385 conditions, 86102 events. 26162/86102 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 1647. Compared 1204059 event pairs, 10794 based on Foata normal form. 0/77051 useless extension candidates. Maximal degree in co-relation 128378. Up to 26496 conditions per place. [2023-11-21 22:19:16,916 INFO L140 encePairwiseOnDemand]: 249/288 looper letters, 98 selfloop transitions, 28 changer transitions 0/305 dead transitions. [2023-11-21 22:19:16,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 305 transitions, 899 flow [2023-11-21 22:19:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:19:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-11-21 22:19:16,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7974537037037037 [2023-11-21 22:19:16,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-11-21 22:19:16,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-11-21 22:19:16,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:19:16,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-11-21 22:19:16,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:16,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:16,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:16,927 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 522 flow. Second operand 3 states and 689 transitions. [2023-11-21 22:19:16,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 305 transitions, 899 flow [2023-11-21 22:19:16,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 305 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 22:19:16,942 INFO L231 Difference]: Finished difference. Result has 255 places, 276 transitions, 766 flow [2023-11-21 22:19:16,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=255, PETRI_TRANSITIONS=276} [2023-11-21 22:19:16,944 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -2 predicate places. [2023-11-21 22:19:16,945 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 276 transitions, 766 flow [2023-11-21 22:19:16,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:16,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:19:16,946 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-21 22:19:16,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:19:16,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-21 22:19:16,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 547700665, now seen corresponding path program 1 times [2023-11-21 22:19:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:16,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590765545] [2023-11-21 22:19:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:16,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:17,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:17,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590765545] [2023-11-21 22:19:17,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590765545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:17,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:19:17,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:19:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307469345] [2023-11-21 22:19:17,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:17,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:19:17,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 288 [2023-11-21 22:19:17,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 276 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:17,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:19:17,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 288 [2023-11-21 22:19:17,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:19:28,809 INFO L124 PetriNetUnfolderBase]: 21691/93664 cut-off events. [2023-11-21 22:19:28,809 INFO L125 PetriNetUnfolderBase]: For 6530/6664 co-relation queries the response was YES. [2023-11-21 22:19:29,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143787 conditions, 93664 events. 21691/93664 cut-off events. For 6530/6664 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 1457438 event pairs, 10188 based on Foata normal form. 0/84509 useless extension candidates. Maximal degree in co-relation 143779. Up to 17533 conditions per place. [2023-11-21 22:19:29,489 INFO L140 encePairwiseOnDemand]: 277/288 looper letters, 65 selfloop transitions, 9 changer transitions 0/307 dead transitions. [2023-11-21 22:19:29,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 307 transitions, 976 flow [2023-11-21 22:19:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:19:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:19:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2023-11-21 22:19:29,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2023-11-21 22:19:29,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 712 transitions. [2023-11-21 22:19:29,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions. [2023-11-21 22:19:29,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:19:29,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions. [2023-11-21 22:19:29,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:29,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:29,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:29,501 INFO L175 Difference]: Start difference. First operand has 255 places, 276 transitions, 766 flow. Second operand 3 states and 712 transitions. [2023-11-21 22:19:29,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 307 transitions, 976 flow [2023-11-21 22:19:29,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 307 transitions, 922 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:19:29,622 INFO L231 Difference]: Finished difference. Result has 256 places, 281 transitions, 770 flow [2023-11-21 22:19:29,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=288, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=256, PETRI_TRANSITIONS=281} [2023-11-21 22:19:29,624 INFO L281 CegarLoopForPetriNet]: 257 programPoint places, -1 predicate places. [2023-11-21 22:19:29,625 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 281 transitions, 770 flow [2023-11-21 22:19:29,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:29,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:19:29,625 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] [2023-11-21 22:19:29,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:19:29,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-11-21 22:19:29,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:19:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -517687831, now seen corresponding path program 1 times [2023-11-21 22:19:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:19:29,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974334896] [2023-11-21 22:19:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:19:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:19:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:19:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974334896] [2023-11-21 22:19:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974334896] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:19:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509178129] [2023-11-21 22:19:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:19:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:19:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:19:29,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:19:30,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9aa88a-a695-481c-a9e8-da14dc905caa/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:19:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:19:30,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:19:30,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:19:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:19:30,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:19:30,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509178129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:19:30,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:19:30,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-21 22:19:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204770308] [2023-11-21 22:19:30,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:19:30,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:19:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:19:30,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:19:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:19:30,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 288 [2023-11-21 22:19:30,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 281 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:19:30,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:19:30,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 288 [2023-11-21 22:19:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:19:31,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L702-14-->L702-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61|))) (and (= (store |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61| (store .cse0 |v_~#__global_lock~0.offset_61| 1)) |v_#pthreadsMutex_151|) (= |v_t_funThread1of2ForFork0_#t~nondet4#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_61|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_152|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_151|, t_funThread1of2ForFork0_#t~nondet4#1=|v_t_funThread1of2ForFork0_#t~nondet4#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~nondet4#1][42], [260#true, Black: 268#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 274#true, 190#L702-5true, 276#(= ~x~0 0), 84#L702-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-21 22:19:31,506 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-21 22:19:31,506 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:19:31,507 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:19:31,507 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-21 22:19:31,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([877] L702-14-->L702-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61|))) (and (= (store |v_#pthreadsMutex_152| |v_~#__global_lock~0.base_61| (store .cse0 |v_~#__global_lock~0.offset_61| 1)) |v_#pthreadsMutex_151|) (= |v_t_funThread1of2ForFork0_#t~nondet4#1_1| 0) (= (select .cse0 |v_~#__global_lock~0.offset_61|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_152|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_151|, t_funThread1of2ForFork0_#t~nondet4#1=|v_t_funThread1of2ForFork0_#t~nondet4#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_61|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_61|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_#t~nondet4#1][42], [260#true, Black: 268#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 274#true, 190#L702-5true, 276#(= ~x~0 0), 84#L702-3true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:31,976 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-21 22:19:31,976 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-21 22:19:31,976 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-21 22:19:31,976 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-21 22:19:32,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 16#L713-13true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 126#L705-3true]) [2023-11-21 22:19:32,958 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-21 22:19:32,958 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-21 22:19:32,958 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-21 22:19:32,958 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-21 22:19:33,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 126#L705-3true]) [2023-11-21 22:19:33,105 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-21 22:19:33,105 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-21 22:19:33,105 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-21 22:19:33,105 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-21 22:19:33,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 243#L702-5true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-21 22:19:33,705 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,705 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,705 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,705 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 126#L705-3true, 23#L713-22true]) [2023-11-21 22:19:33,736 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,736 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,736 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,736 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, 57#L706-10true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 16#L713-13true, 274#true, 58#L706-3true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2023-11-21 22:19:33,739 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,739 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,739 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,739 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-21 22:19:33,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 94#L702-6true]) [2023-11-21 22:19:33,877 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,877 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,877 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,877 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 58#L706-3true, 173#L713-16true]) [2023-11-21 22:19:33,913 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,913 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,913 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:33,914 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-21 22:19:34,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 243#L702-5true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:34,218 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-21 22:19:34,218 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:19:34,218 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:19:34,218 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-21 22:19:34,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([923] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread1of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread1of2ForFork0_#t~nondet10#1=|v_t_funThread1of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][161], [260#true, t_funThread1of2ForFork0InUse, 57#L706-10true, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 58#L706-3true, 280#true, 23#L713-22true]) [2023-11-21 22:19:34,250 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,250 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,250 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,250 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 94#L702-6true, 23#L713-22true]) [2023-11-21 22:19:34,397 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,398 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,398 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:19:34,398 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-21 22:19:35,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-21 22:19:35,465 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-21 22:19:35,465 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-21 22:19:35,465 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-21 22:19:35,465 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-21 22:19:36,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), 106#L706-10true, t_funThread2of2ForFork0InUse, 220#L703-2true, Black: 276#(= ~x~0 0), 274#true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L713-16true]) [2023-11-21 22:19:36,426 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,426 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,426 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,427 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:36,430 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,430 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,430 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-21 22:19:36,430 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-21 22:19:37,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L706-9-->L706-10: Formula: (= |v_#race~x~0_19| |v_t_funThread2of2ForFork0_#t~nondet10#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} OutVars{#race~x~0=|v_#race~x~0_19|, t_funThread2of2ForFork0_#t~nondet10#1=|v_t_funThread2of2ForFork0_#t~nondet10#1_3|} AuxVars[] AssignedVars[#race~x~0][217], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 220#L703-2true, 106#L706-10true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:37,360 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,360 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,360 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,360 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 243#L702-5true, 7#L706-29true, 274#true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L713-16true]) [2023-11-21 22:19:37,380 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,381 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,381 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,381 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-21 22:19:37,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 7#L706-29true, 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 94#L702-6true]) [2023-11-21 22:19:37,616 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,617 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,617 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,617 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread1of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} OutVars{#race~x~0=|v_#race~x~0_25|, t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~x~0][245], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 231#L706-29true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true, 89#L702-6true]) [2023-11-21 22:19:37,713 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,713 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,713 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-21 22:19:37,713 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-21 22:19:38,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 243#L702-5true, 274#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:38,502 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-21 22:19:38,502 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-21 22:19:38,502 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-21 22:19:38,502 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-21 22:19:38,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 94#L702-6true, 23#L713-22true]) [2023-11-21 22:19:38,681 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,682 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,682 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,682 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread1of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} OutVars{#race~x~0=|v_#race~x~0_25|, t_funThread1of2ForFork0_#t~nondet14#1=|v_t_funThread1of2ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~x~0][245], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 231#L706-29true, Black: 276#(= ~x~0 0), 274#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 89#L702-6true, 23#L713-22true]) [2023-11-21 22:19:38,749 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,749 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,749 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-21 22:19:38,749 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-21 22:19:39,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 274#true, 7#L706-29true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 173#L713-16true]) [2023-11-21 22:19:39,952 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-21 22:19:39,952 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-21 22:19:39,952 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-21 22:19:39,952 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-21 22:19:40,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 220#L703-2true, Black: 276#(= ~x~0 0), 7#L706-29true, 274#true, 280#true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 173#L713-16true]) [2023-11-21 22:19:40,637 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,637 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,637 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,637 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, Black: 276#(= ~x~0 0), 7#L706-29true, 274#true, 168#L702-12true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:40,641 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,641 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,641 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:19:40,641 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-21 22:19:41,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1005] L706-28-->L706-29: Formula: (= |v_#race~x~0_25| |v_t_funThread2of2ForFork0_#t~nondet14#1_3|) InVars {t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|} OutVars{t_funThread2of2ForFork0_#t~nondet14#1=|v_t_funThread2of2ForFork0_#t~nondet14#1_3|, #race~x~0=|v_#race~x~0_25|} AuxVars[] AssignedVars[#race~x~0][287], [260#true, t_funThread1of2ForFork0InUse, Black: 270#(= |#race~x~0| 0), t_funThread2of2ForFork0InUse, 220#L703-2true, Black: 276#(= ~x~0 0), 274#true, 7#L706-29true, Black: 265#(= |ULTIMATE.start_main_~i~0#1| 0), 280#true, 23#L713-22true]) [2023-11-21 22:19:41,602 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-21 22:19:41,602 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-21 22:19:41,602 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-21 22:19:41,602 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event