./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:33,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:33,741 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:13:33,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:33,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:33,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:33,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:33,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:33,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:33,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:33,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:33,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:33,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:33,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:33,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:33,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:33,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:13:33,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:33,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:33,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:33,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:33,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:33,803 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:13:33,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:33,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:13:33,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:33,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:33,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:33,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:33,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:33,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:33,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:33,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:33,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:33,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:33,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:13:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:13:33,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:33,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:33,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:33,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:33,811 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_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/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_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2024-10-31 22:13:34,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:34,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:34,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:34,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:34,155 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:34,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i Unable to find full path for "g++" [2024-10-31 22:13:36,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:36,463 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:36,464 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2024-10-31 22:13:36,489 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/data/184b0cfa6/33a251eb593c4e1f98b3078def66fc85/FLAG0e33f6dca [2024-10-31 22:13:36,512 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/data/184b0cfa6/33a251eb593c4e1f98b3078def66fc85 [2024-10-31 22:13:36,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:36,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:36,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:36,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:36,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:36,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:36" (1/1) ... [2024-10-31 22:13:36,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78224909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:36, skipping insertion in model container [2024-10-31 22:13:36,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:36" (1/1) ... [2024-10-31 22:13:36,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:37,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:37,221 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:37,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:37,377 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:37,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37 WrapperNode [2024-10-31 22:13:37,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:37,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:37,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:37,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:37,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,453 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2024-10-31 22:13:37,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:37,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:37,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:37,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:37,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:37,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:37,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:37,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:37,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (1/1) ... [2024-10-31 22:13:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:37,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:37,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:37,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:13:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:13:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:13:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-31 22:13:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-31 22:13:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:13:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-31 22:13:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-31 22:13:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:13:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:37,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:37,636 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:13:37,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:37,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:38,188 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:13:38,189 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:38,252 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:38,253 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-31 22:13:38,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:38 BoogieIcfgContainer [2024-10-31 22:13:38,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:38,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:38,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:38,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:38,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:36" (1/3) ... [2024-10-31 22:13:38,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490e1f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:38, skipping insertion in model container [2024-10-31 22:13:38,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:37" (2/3) ... [2024-10-31 22:13:38,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490e1f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:38, skipping insertion in model container [2024-10-31 22:13:38,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:38" (3/3) ... [2024-10-31 22:13:38,267 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2024-10-31 22:13:38,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:38,288 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-31 22:13:38,288 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:13:38,377 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-31 22:13:38,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 161 transitions, 329 flow [2024-10-31 22:13:38,560 INFO L124 PetriNetUnfolderBase]: 25/230 cut-off events. [2024-10-31 22:13:38,562 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:13:38,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 230 events. 25/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 681 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 119. Up to 6 conditions per place. [2024-10-31 22:13:38,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 161 transitions, 329 flow [2024-10-31 22:13:38,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 161 transitions, 329 flow [2024-10-31 22:13:38,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:38,608 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a468146, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:38,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-31 22:13:38,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:13:38,635 INFO L124 PetriNetUnfolderBase]: 3/60 cut-off events. [2024-10-31 22:13:38,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:13:38,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:38,637 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:38,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:13:38,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1847936763, now seen corresponding path program 1 times [2024-10-31 22:13:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996875576] [2024-10-31 22:13:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:39,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996875576] [2024-10-31 22:13:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996875576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273862611] [2024-10-31 22:13:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:39,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:40,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 161 [2024-10-31 22:13:40,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 161 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:40,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:40,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 161 [2024-10-31 22:13:40,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:40,549 INFO L124 PetriNetUnfolderBase]: 121/733 cut-off events. [2024-10-31 22:13:40,550 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:13:40,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 733 events. 121/733 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4309 event pairs, 7 based on Foata normal form. 108/763 useless extension candidates. Maximal degree in co-relation 856. Up to 174 conditions per place. [2024-10-31 22:13:40,561 INFO L140 encePairwiseOnDemand]: 143/161 looper letters, 48 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2024-10-31 22:13:40,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 170 transitions, 453 flow [2024-10-31 22:13:40,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:13:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 798 transitions. [2024-10-31 22:13:40,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2024-10-31 22:13:40,588 INFO L175 Difference]: Start difference. First operand has 148 places, 161 transitions, 329 flow. Second operand 6 states and 798 transitions. [2024-10-31 22:13:40,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 170 transitions, 453 flow [2024-10-31 22:13:40,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 170 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:13:40,600 INFO L231 Difference]: Finished difference. Result has 150 places, 146 transitions, 309 flow [2024-10-31 22:13:40,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=150, PETRI_TRANSITIONS=146} [2024-10-31 22:13:40,606 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 2 predicate places. [2024-10-31 22:13:40,607 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 146 transitions, 309 flow [2024-10-31 22:13:40,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:40,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:40,608 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:13:40,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:13:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash 944421903, now seen corresponding path program 1 times [2024-10-31 22:13:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136801443] [2024-10-31 22:13:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:40,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136801443] [2024-10-31 22:13:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136801443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582268149] [2024-10-31 22:13:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:40,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:40,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:40,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 161 [2024-10-31 22:13:40,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 146 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:40,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:40,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 161 [2024-10-31 22:13:40,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:40,991 INFO L124 PetriNetUnfolderBase]: 57/590 cut-off events. [2024-10-31 22:13:40,995 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-31 22:13:40,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 590 events. 57/590 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2930 event pairs, 25 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 634. Up to 96 conditions per place. [2024-10-31 22:13:41,000 INFO L140 encePairwiseOnDemand]: 158/161 looper letters, 22 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2024-10-31 22:13:41,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 152 transitions, 369 flow [2024-10-31 22:13:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-10-31 22:13:41,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8592132505175983 [2024-10-31 22:13:41,003 INFO L175 Difference]: Start difference. First operand has 150 places, 146 transitions, 309 flow. Second operand 3 states and 415 transitions. [2024-10-31 22:13:41,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 152 transitions, 369 flow [2024-10-31 22:13:41,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 152 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:13:41,007 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 307 flow [2024-10-31 22:13:41,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2024-10-31 22:13:41,009 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2024-10-31 22:13:41,009 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 307 flow [2024-10-31 22:13:41,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:41,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:41,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:41,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:13:41,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:13:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:41,011 INFO L85 PathProgramCache]: Analyzing trace with hash 224079106, now seen corresponding path program 1 times [2024-10-31 22:13:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205065706] [2024-10-31 22:13:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205065706] [2024-10-31 22:13:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205065706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:41,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910578877] [2024-10-31 22:13:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:41,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:41,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:41,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 161 [2024-10-31 22:13:41,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:41,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:41,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 161 [2024-10-31 22:13:41,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:41,327 INFO L124 PetriNetUnfolderBase]: 134/885 cut-off events. [2024-10-31 22:13:41,327 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-31 22:13:41,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 885 events. 134/885 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5395 event pairs, 33 based on Foata normal form. 0/788 useless extension candidates. Maximal degree in co-relation 1088. Up to 130 conditions per place. [2024-10-31 22:13:41,334 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 30 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2024-10-31 22:13:41,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 159 transitions, 408 flow [2024-10-31 22:13:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-10-31 22:13:41,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2024-10-31 22:13:41,339 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 307 flow. Second operand 3 states and 414 transitions. [2024-10-31 22:13:41,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 159 transitions, 408 flow [2024-10-31 22:13:41,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 159 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:13:41,349 INFO L231 Difference]: Finished difference. Result has 148 places, 148 transitions, 341 flow [2024-10-31 22:13:41,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=148, PETRI_TRANSITIONS=148} [2024-10-31 22:13:41,350 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 0 predicate places. [2024-10-31 22:13:41,350 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 148 transitions, 341 flow [2024-10-31 22:13:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:41,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:41,351 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:41,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:13:41,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:13:41,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash -58927642, now seen corresponding path program 1 times [2024-10-31 22:13:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765839487] [2024-10-31 22:13:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:41,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:41,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:41,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765839487] [2024-10-31 22:13:41,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765839487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:41,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:41,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:41,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478596196] [2024-10-31 22:13:41,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:41,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:41,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:41,460 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 161 [2024-10-31 22:13:41,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 148 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:41,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:41,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 161 [2024-10-31 22:13:41,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:41,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([479] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_5| v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][151], [Black: 159#(= |ULTIMATE.start_main_~i~1#1| 0), 161#true, Black: 163#(= |#race~global~0| 0), 148#true, 166#true, 95#L952-9true]) [2024-10-31 22:13:41,645 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2024-10-31 22:13:41,645 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2024-10-31 22:13:41,646 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-10-31 22:13:41,646 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2024-10-31 22:13:41,656 INFO L124 PetriNetUnfolderBase]: 139/966 cut-off events. [2024-10-31 22:13:41,656 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-10-31 22:13:41,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 966 events. 139/966 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6222 event pairs, 56 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1267. Up to 220 conditions per place. [2024-10-31 22:13:41,662 INFO L140 encePairwiseOnDemand]: 156/161 looper letters, 27 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2024-10-31 22:13:41,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 155 transitions, 421 flow [2024-10-31 22:13:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-10-31 22:13:41,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2024-10-31 22:13:41,666 INFO L175 Difference]: Start difference. First operand has 148 places, 148 transitions, 341 flow. Second operand 3 states and 410 transitions. [2024-10-31 22:13:41,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 155 transitions, 421 flow [2024-10-31 22:13:41,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 155 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:13:41,672 INFO L231 Difference]: Finished difference. Result has 150 places, 151 transitions, 361 flow [2024-10-31 22:13:41,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=361, PETRI_PLACES=150, PETRI_TRANSITIONS=151} [2024-10-31 22:13:41,674 INFO L277 CegarLoopForPetriNet]: 148 programPoint places, 2 predicate places. [2024-10-31 22:13:41,675 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 151 transitions, 361 flow [2024-10-31 22:13:41,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:41,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:41,676 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:41,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:13:41,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:13:41,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1729545263, now seen corresponding path program 1 times [2024-10-31 22:13:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965437185] [2024-10-31 22:13:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:41,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:41,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:41,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:41,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:13:41,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-31 22:13:41,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-31 22:13:41,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-31 22:13:41,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-31 22:13:41,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-31 22:13:41,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-31 22:13:41,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-31 22:13:41,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-31 22:13:41,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-31 22:13:41,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-31 22:13:41,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-31 22:13:41,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-31 22:13:41,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:13:41,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-31 22:13:41,801 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:13:41,801 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 22:13:41,844 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:13:41,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 210 transitions, 436 flow [2024-10-31 22:13:41,902 INFO L124 PetriNetUnfolderBase]: 43/376 cut-off events. [2024-10-31 22:13:41,902 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-31 22:13:41,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 376 events. 43/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1305 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 232. Up to 9 conditions per place. [2024-10-31 22:13:41,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 210 transitions, 436 flow [2024-10-31 22:13:41,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 210 transitions, 436 flow [2024-10-31 22:13:41,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:41,917 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a468146, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:41,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-31 22:13:41,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:13:41,924 INFO L124 PetriNetUnfolderBase]: 3/60 cut-off events. [2024-10-31 22:13:41,924 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:13:41,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:41,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:41,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:41,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -936262459, now seen corresponding path program 1 times [2024-10-31 22:13:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:41,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947952085] [2024-10-31 22:13:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:42,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947952085] [2024-10-31 22:13:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947952085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:42,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:42,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734916797] [2024-10-31 22:13:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:42,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:42,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:42,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:42,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 210 [2024-10-31 22:13:42,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 210 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:42,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:42,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 210 [2024-10-31 22:13:42,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:43,835 INFO L124 PetriNetUnfolderBase]: 1710/6098 cut-off events. [2024-10-31 22:13:43,835 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-31 22:13:43,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8813 conditions, 6098 events. 1710/6098 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 59357 event pairs, 222 based on Foata normal form. 1344/6852 useless extension candidates. Maximal degree in co-relation 1151. Up to 1840 conditions per place. [2024-10-31 22:13:43,891 INFO L140 encePairwiseOnDemand]: 186/210 looper letters, 80 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2024-10-31 22:13:43,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 237 transitions, 660 flow [2024-10-31 22:13:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:13:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2024-10-31 22:13:43,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2024-10-31 22:13:43,896 INFO L175 Difference]: Start difference. First operand has 192 places, 210 transitions, 436 flow. Second operand 6 states and 1070 transitions. [2024-10-31 22:13:43,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 237 transitions, 660 flow [2024-10-31 22:13:43,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 237 transitions, 660 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:13:43,902 INFO L231 Difference]: Finished difference. Result has 194 places, 189 transitions, 404 flow [2024-10-31 22:13:43,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=194, PETRI_TRANSITIONS=189} [2024-10-31 22:13:43,903 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 2 predicate places. [2024-10-31 22:13:43,904 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 189 transitions, 404 flow [2024-10-31 22:13:43,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:43,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:43,905 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:13:43,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 890106383, now seen corresponding path program 1 times [2024-10-31 22:13:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868840367] [2024-10-31 22:13:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868840367] [2024-10-31 22:13:43,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868840367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:43,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:43,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:43,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029401136] [2024-10-31 22:13:43,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:43,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:43,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:43,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2024-10-31 22:13:43,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 189 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:43,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:43,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2024-10-31 22:13:43,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:44,898 INFO L124 PetriNetUnfolderBase]: 972/5060 cut-off events. [2024-10-31 22:13:44,899 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-10-31 22:13:44,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 5060 events. 972/5060 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 48919 event pairs, 657 based on Foata normal form. 1/4465 useless extension candidates. Maximal degree in co-relation 4983. Up to 1438 conditions per place. [2024-10-31 22:13:44,945 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 31 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2024-10-31 22:13:44,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 196 transitions, 486 flow [2024-10-31 22:13:44,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2024-10-31 22:13:44,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8396825396825397 [2024-10-31 22:13:44,948 INFO L175 Difference]: Start difference. First operand has 194 places, 189 transitions, 404 flow. Second operand 3 states and 529 transitions. [2024-10-31 22:13:44,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 196 transitions, 486 flow [2024-10-31 22:13:44,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 196 transitions, 474 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-31 22:13:44,954 INFO L231 Difference]: Finished difference. Result has 192 places, 190 transitions, 406 flow [2024-10-31 22:13:44,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=192, PETRI_TRANSITIONS=190} [2024-10-31 22:13:44,955 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 0 predicate places. [2024-10-31 22:13:44,955 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 190 transitions, 406 flow [2024-10-31 22:13:44,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:44,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:44,956 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:44,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:13:44,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1315426883, now seen corresponding path program 1 times [2024-10-31 22:13:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:44,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576491687] [2024-10-31 22:13:44,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:44,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:45,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576491687] [2024-10-31 22:13:45,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576491687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:45,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198766405] [2024-10-31 22:13:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:45,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:45,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:45,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:45,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 210 [2024-10-31 22:13:45,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 190 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:45,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:45,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 210 [2024-10-31 22:13:45,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:46,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 190#true, 192#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:46,318 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2024-10-31 22:13:46,318 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2024-10-31 22:13:46,318 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-10-31 22:13:46,319 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2024-10-31 22:13:47,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, 50#$Ultimate##0true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,216 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-10-31 22:13:47,216 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:47,216 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:47,216 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:47,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 28#$Ultimate##0true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,227 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-10-31 22:13:47,227 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:47,228 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:47,228 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:47,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [120#L938-3true, 113#L952-9true, 201#true, 205#true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,261 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-31 22:13:47,261 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-31 22:13:47,261 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-31 22:13:47,261 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-31 22:13:47,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 54#L938-3true]) [2024-10-31 22:13:47,296 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-10-31 22:13:47,296 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-10-31 22:13:47,297 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-31 22:13:47,297 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-31 22:13:47,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 115#L939-3true, 201#true, 205#true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,372 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-31 22:13:47,373 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:13:47,376 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:13:47,377 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:13:47,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, 11#L939-3true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,410 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-31 22:13:47,411 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:13:47,411 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-31 22:13:47,411 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-31 22:13:47,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][219], [113#L952-9true, 201#true, 193#true, 190#true, 207#(= |#race~global~0| 0), Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 81#L939-5true]) [2024-10-31 22:13:47,411 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-31 22:13:47,412 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:13:47,412 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:13:47,412 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:13:47,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][219], [113#L952-9true, 139#L939-6true, 201#true, 193#true, 190#true, 207#(= |#race~global~0| 0), Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,476 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-31 22:13:47,476 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-31 22:13:47,476 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:13:47,476 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-31 22:13:47,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 81#L939-5true]) [2024-10-31 22:13:47,477 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2024-10-31 22:13:47,477 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:13:47,477 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-10-31 22:13:47,477 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-10-31 22:13:47,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [136#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 113#L952-9true, 201#true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,478 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-31 22:13:47,478 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-31 22:13:47,478 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:13:47,478 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-31 22:13:47,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 139#L939-6true, 201#true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,509 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-31 22:13:47,509 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:13:47,509 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:13:47,509 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:13:47,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 76#L939-10true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,592 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-10-31 22:13:47,593 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-31 22:13:47,593 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-31 22:13:47,593 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-31 22:13:47,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 179#L939-10true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,613 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is not cut-off event [2024-10-31 22:13:47,613 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:47,613 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-31 22:13:47,613 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:47,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [146#L939-16true, 113#L952-9true, 201#true, 205#true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,670 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-31 22:13:47,670 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-31 22:13:47,670 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:13:47,670 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:13:47,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, 102#L939-16true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,756 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is not cut-off event [2024-10-31 22:13:47,756 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:13:47,756 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:13:47,756 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2024-10-31 22:13:47,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 192#true, 148#L939-22true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,789 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-31 22:13:47,789 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:13:47,789 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:13:47,790 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:13:47,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [17#L939-22true, 113#L952-9true, 201#true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,806 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-31 22:13:47,806 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:13:47,806 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-31 22:13:47,806 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:13:47,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][218], [113#L952-9true, 201#true, 9#L939-24true, 192#true, 191#true, 207#(= |#race~global~0| 0), Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,826 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:13:47,827 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,827 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,827 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-31 22:13:47,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, 53#L939-24true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,845 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is not cut-off event [2024-10-31 22:13:47,845 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-31 22:13:47,845 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-31 22:13:47,846 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-31 22:13:47,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 99#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,846 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,846 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,846 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:47,846 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][218], [113#L952-9true, 201#true, 192#true, 47#L939-25true, 191#true, 207#(= |#race~global~0| 0), Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,847 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,848 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:47,848 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,848 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 9#L939-24true, 205#true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,853 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is not cut-off event [2024-10-31 22:13:47,853 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-31 22:13:47,853 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-31 22:13:47,853 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-31 22:13:47,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 14#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,854 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,854 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:47,854 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,854 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, 108#L939-25true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,865 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-31 22:13:47,866 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-31 22:13:47,866 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-31 22:13:47,866 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-31 22:13:47,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 192#true, 47#L939-25true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,867 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-31 22:13:47,867 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-31 22:13:47,868 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-31 22:13:47,868 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-31 22:13:47,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 192#true, 191#true, 71#L939-29true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,896 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-10-31 22:13:47,897 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-31 22:13:47,897 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:13:47,897 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:13:47,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 12#L939-29true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,916 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2024-10-31 22:13:47,916 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:13:47,916 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:13:47,916 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-31 22:13:47,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][219], [113#L952-9true, 201#true, 193#true, 190#true, 53#L939-24true, 207#(= |#race~global~0| 0), Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,917 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-31 22:13:47,917 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,917 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,917 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:13:47,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][219], [113#L952-9true, 201#true, 193#true, 190#true, 207#(= |#race~global~0| 0), 108#L939-25true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,918 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-10-31 22:13:47,919 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,919 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:13:47,919 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:47,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [5#L939-35true, 113#L952-9true, 201#true, 205#true, 192#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,931 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-31 22:13:47,931 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-10-31 22:13:47,931 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:13:47,932 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:13:47,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [201#true, 113#L952-9true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 188#L939-35true]) [2024-10-31 22:13:47,938 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2024-10-31 22:13:47,938 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-31 22:13:47,939 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-10-31 22:13:47,939 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-31 22:13:47,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][217], [113#L952-9true, 201#true, 205#true, 192#true, 191#true, 159#L940-2true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:47,955 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-31 22:13:47,955 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:47,955 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-10-31 22:13:47,955 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:47,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, 201#true, 205#true, 193#true, 190#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 55#L940-2true]) [2024-10-31 22:13:47,960 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2024-10-31 22:13:47,960 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is not cut-off event [2024-10-31 22:13:47,960 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-31 22:13:47,960 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-31 22:13:47,996 INFO L124 PetriNetUnfolderBase]: 4754/15584 cut-off events. [2024-10-31 22:13:47,996 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2024-10-31 22:13:48,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22964 conditions, 15584 events. 4754/15584 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 174589 event pairs, 1581 based on Foata normal form. 0/13774 useless extension candidates. Maximal degree in co-relation 22903. Up to 3673 conditions per place. [2024-10-31 22:13:48,149 INFO L140 encePairwiseOnDemand]: 191/210 looper letters, 58 selfloop transitions, 14 changer transitions 0/223 dead transitions. [2024-10-31 22:13:48,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 223 transitions, 627 flow [2024-10-31 22:13:48,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2024-10-31 22:13:48,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.846031746031746 [2024-10-31 22:13:48,151 INFO L175 Difference]: Start difference. First operand has 192 places, 190 transitions, 406 flow. Second operand 3 states and 533 transitions. [2024-10-31 22:13:48,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 223 transitions, 627 flow [2024-10-31 22:13:48,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 223 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:13:48,157 INFO L231 Difference]: Finished difference. Result has 195 places, 204 transitions, 526 flow [2024-10-31 22:13:48,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=195, PETRI_TRANSITIONS=204} [2024-10-31 22:13:48,159 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 3 predicate places. [2024-10-31 22:13:48,159 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 204 transitions, 526 flow [2024-10-31 22:13:48,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:48,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:48,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:48,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:13:48,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:48,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:48,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1922286185, now seen corresponding path program 1 times [2024-10-31 22:13:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971327205] [2024-10-31 22:13:48,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971327205] [2024-10-31 22:13:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971327205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217092939] [2024-10-31 22:13:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:48,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:48,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 210 [2024-10-31 22:13:48,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 204 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:48,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:48,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 210 [2024-10-31 22:13:48,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:49,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 190#true, 192#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:49,861 INFO L294 olderBase$Statistics]: this new event has 107 ancestors and is not cut-off event [2024-10-31 22:13:49,862 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is not cut-off event [2024-10-31 22:13:49,862 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2024-10-31 22:13:49,862 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2024-10-31 22:13:50,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 193#true, 190#true, 210#true, 50#$Ultimate##0true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:50,729 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-10-31 22:13:50,729 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:50,729 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:50,729 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:50,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 28#$Ultimate##0true, 192#true, 210#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:50,740 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2024-10-31 22:13:50,740 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:50,740 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:50,740 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2024-10-31 22:13:50,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [120#L938-3true, 113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 192#true, 210#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:50,785 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-31 22:13:50,785 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-31 22:13:50,785 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-10-31 22:13:50,785 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-10-31 22:13:50,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 54#L938-3true]) [2024-10-31 22:13:50,820 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-10-31 22:13:50,820 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-10-31 22:13:50,820 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-31 22:13:50,820 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-10-31 22:13:50,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 115#L939-3true, 205#true, 192#true, 210#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:50,897 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-31 22:13:50,898 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:13:50,898 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-31 22:13:50,898 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-31 22:13:50,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 193#true, 190#true, 210#true, 11#L939-3true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:50,925 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-31 22:13:50,925 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-31 22:13:50,925 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-31 22:13:50,925 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-31 22:13:50,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 205#true, 113#L952-9true, 193#true, 190#true, 210#true, 207#(= |#race~global~0| 0), Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 81#L939-5true]) [2024-10-31 22:13:50,926 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-10-31 22:13:50,926 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:13:50,926 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-31 22:13:50,926 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:13:50,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 81#L939-5true]) [2024-10-31 22:13:50,991 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2024-10-31 22:13:50,991 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-10-31 22:13:50,991 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-10-31 22:13:50,991 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:13:51,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 139#L939-6true, 113#L952-9true, 205#true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,027 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-31 22:13:51,028 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:13:51,028 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-31 22:13:51,028 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-31 22:13:51,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 179#L939-10true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,248 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is not cut-off event [2024-10-31 22:13:51,248 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:51,248 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-31 22:13:51,248 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is not cut-off event [2024-10-31 22:13:51,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [75#L939-13true, 113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 192#true, 210#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,285 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-31 22:13:51,286 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:13:51,286 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-31 22:13:51,286 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-31 22:13:51,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [146#L939-16true, 113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 192#true, 210#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,298 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-31 22:13:51,298 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:13:51,298 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-31 22:13:51,298 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-31 22:13:51,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 193#true, 190#true, 210#true, 102#L939-16true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,313 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is not cut-off event [2024-10-31 22:13:51,313 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:13:51,313 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-31 22:13:51,314 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2024-10-31 22:13:51,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 192#true, 210#true, 148#L939-22true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,347 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-31 22:13:51,347 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:13:51,348 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:13:51,348 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-31 22:13:51,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [17#L939-22true, Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,362 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-31 22:13:51,362 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:13:51,362 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-31 22:13:51,362 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-31 22:13:51,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [Black: 205#true, 113#L952-9true, 9#L939-24true, 192#true, 210#true, 207#(= |#race~global~0| 0), 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,375 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-31 22:13:51,375 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-31 22:13:51,375 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:51,375 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:51,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 192#true, 210#true, 191#true, 71#L939-29true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,420 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-10-31 22:13:51,420 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-10-31 22:13:51,420 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:13:51,420 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-31 22:13:51,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 193#true, 12#L939-29true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,427 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is not cut-off event [2024-10-31 22:13:51,427 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is not cut-off event [2024-10-31 22:13:51,427 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is not cut-off event [2024-10-31 22:13:51,427 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is not cut-off event [2024-10-31 22:13:51,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 205#true, 113#L952-9true, 193#true, 190#true, 210#true, 207#(= |#race~global~0| 0), 53#L939-24true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,434 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-31 22:13:51,434 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-31 22:13:51,434 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:51,434 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:13:51,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [5#L939-35true, Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 192#true, 210#true, 191#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,442 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-31 22:13:51,442 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-10-31 22:13:51,442 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:13:51,442 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:13:51,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 188#L939-35true]) [2024-10-31 22:13:51,449 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2024-10-31 22:13:51,450 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-31 22:13:51,450 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-31 22:13:51,450 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is not cut-off event [2024-10-31 22:13:51,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([738] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 |v_ULTIMATE.start_main_#t~mem53#1_9|) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [Black: 207#(= |#race~global~0| 0), 113#L952-9true, 205#true, 192#true, 210#true, 191#true, 159#L940-2true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-31 22:13:51,465 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-31 22:13:51,465 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:51,465 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-10-31 22:13:51,465 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-31 22:13:51,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([737] t_funEXIT-->L952-9: Formula: (= |v_ULTIMATE.start_main_#t~mem53#1_7| v_t_funThread1of2ForFork0_thidvar0_4) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][191], [113#L952-9true, Black: 207#(= |#race~global~0| 0), 205#true, 193#true, 190#true, 210#true, Black: 203#(= |ULTIMATE.start_main_~i~1#1| 0), 55#L940-2true]) [2024-10-31 22:13:51,469 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event [2024-10-31 22:13:51,469 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-31 22:13:51,469 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is not cut-off event [2024-10-31 22:13:51,469 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-31 22:13:51,503 INFO L124 PetriNetUnfolderBase]: 4902/17955 cut-off events. [2024-10-31 22:13:51,503 INFO L125 PetriNetUnfolderBase]: For 4538/4696 co-relation queries the response was YES. [2024-10-31 22:13:51,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29529 conditions, 17955 events. 4902/17955 cut-off events. For 4538/4696 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 214390 event pairs, 2418 based on Foata normal form. 45/16138 useless extension candidates. Maximal degree in co-relation 28053. Up to 6184 conditions per place. [2024-10-31 22:13:51,671 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 52 selfloop transitions, 14 changer transitions 0/228 dead transitions. [2024-10-31 22:13:51,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 228 transitions, 744 flow [2024-10-31 22:13:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-10-31 22:13:51,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8365079365079365 [2024-10-31 22:13:51,674 INFO L175 Difference]: Start difference. First operand has 195 places, 204 transitions, 526 flow. Second operand 3 states and 527 transitions. [2024-10-31 22:13:51,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 228 transitions, 744 flow [2024-10-31 22:13:51,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 228 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:13:51,691 INFO L231 Difference]: Finished difference. Result has 197 places, 216 transitions, 624 flow [2024-10-31 22:13:51,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=197, PETRI_TRANSITIONS=216} [2024-10-31 22:13:51,692 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, 5 predicate places. [2024-10-31 22:13:51,693 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 216 transitions, 624 flow [2024-10-31 22:13:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:51,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:51,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:13:51,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:51,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1166788744, now seen corresponding path program 1 times [2024-10-31 22:13:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:51,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920088632] [2024-10-31 22:13:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:51,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920088632] [2024-10-31 22:13:51,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920088632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:51,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137263927] [2024-10-31 22:13:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:51,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:51,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:13:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:51,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:13:51,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:52,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:52,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137263927] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:52,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:52,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-31 22:13:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608991137] [2024-10-31 22:13:52,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:52,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:13:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:13:52,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:13:52,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2024-10-31 22:13:52,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 216 transitions, 624 flow. Second operand has 10 states, 10 states have (on average 164.1) internal successors, (1641), 10 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:52,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:52,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2024-10-31 22:13:52,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:53,080 INFO L124 PetriNetUnfolderBase]: 754/3569 cut-off events. [2024-10-31 22:13:53,080 INFO L125 PetriNetUnfolderBase]: For 484/518 co-relation queries the response was YES. [2024-10-31 22:13:53,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 3569 events. 754/3569 cut-off events. For 484/518 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 32477 event pairs, 26 based on Foata normal form. 108/3449 useless extension candidates. Maximal degree in co-relation 2667. Up to 478 conditions per place. [2024-10-31 22:13:53,115 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 72 selfloop transitions, 7 changer transitions 0/213 dead transitions. [2024-10-31 22:13:53,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 213 transitions, 730 flow [2024-10-31 22:13:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:13:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-31 22:13:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1539 transitions. [2024-10-31 22:13:53,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2024-10-31 22:13:53,121 INFO L175 Difference]: Start difference. First operand has 197 places, 216 transitions, 624 flow. Second operand 9 states and 1539 transitions. [2024-10-31 22:13:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 213 transitions, 730 flow [2024-10-31 22:13:53,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 213 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:13:53,129 INFO L231 Difference]: Finished difference. Result has 153 places, 157 transitions, 454 flow [2024-10-31 22:13:53,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=153, PETRI_TRANSITIONS=157} [2024-10-31 22:13:53,130 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, -39 predicate places. [2024-10-31 22:13:53,130 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 157 transitions, 454 flow [2024-10-31 22:13:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 164.1) internal successors, (1641), 10 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:53,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:53,132 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:53,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:53,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c9b0b2f-a06e-42e0-b658-28d3f9745250/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-31 22:13:53,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:53,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1855886014, now seen corresponding path program 1 times [2024-10-31 22:13:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887695078] [2024-10-31 22:13:53,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-31 22:13:53,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887695078] [2024-10-31 22:13:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887695078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:53,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:53,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903802495] [2024-10-31 22:13:53,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:53,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:53,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 210 [2024-10-31 22:13:53,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 157 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:53,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:53,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 210 [2024-10-31 22:13:53,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:53,786 INFO L124 PetriNetUnfolderBase]: 260/1298 cut-off events. [2024-10-31 22:13:53,786 INFO L125 PetriNetUnfolderBase]: For 454/475 co-relation queries the response was YES. [2024-10-31 22:13:53,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1298 events. 260/1298 cut-off events. For 454/475 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8690 event pairs, 132 based on Foata normal form. 7/1213 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-10-31 22:13:53,799 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 42 selfloop transitions, 12 changer transitions 0/171 dead transitions. [2024-10-31 22:13:53,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 171 transitions, 606 flow [2024-10-31 22:13:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-10-31 22:13:53,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2024-10-31 22:13:53,802 INFO L175 Difference]: Start difference. First operand has 153 places, 157 transitions, 454 flow. Second operand 3 states and 513 transitions. [2024-10-31 22:13:53,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 171 transitions, 606 flow [2024-10-31 22:13:53,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 171 transitions, 591 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-31 22:13:53,808 INFO L231 Difference]: Finished difference. Result has 152 places, 165 transitions, 537 flow [2024-10-31 22:13:53,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=152, PETRI_TRANSITIONS=165} [2024-10-31 22:13:53,809 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, -40 predicate places. [2024-10-31 22:13:53,810 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 165 transitions, 537 flow [2024-10-31 22:13:53,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:53,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:53,811 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:53,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:13:53,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1847375483, now seen corresponding path program 1 times [2024-10-31 22:13:53,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:53,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618252305] [2024-10-31 22:13:53,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618252305] [2024-10-31 22:13:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618252305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:53,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:53,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031648598] [2024-10-31 22:13:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:53,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:53,925 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 210 [2024-10-31 22:13:53,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 165 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:53,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:53,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 210 [2024-10-31 22:13:53,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:13:54,346 INFO L124 PetriNetUnfolderBase]: 291/1370 cut-off events. [2024-10-31 22:13:54,346 INFO L125 PetriNetUnfolderBase]: For 1126/1161 co-relation queries the response was YES. [2024-10-31 22:13:54,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 1370 events. 291/1370 cut-off events. For 1126/1161 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9392 event pairs, 134 based on Foata normal form. 9/1303 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-10-31 22:13:54,355 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 49 selfloop transitions, 12 changer transitions 0/180 dead transitions. [2024-10-31 22:13:54,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 180 transitions, 726 flow [2024-10-31 22:13:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:13:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-10-31 22:13:54,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8158730158730159 [2024-10-31 22:13:54,357 INFO L175 Difference]: Start difference. First operand has 152 places, 165 transitions, 537 flow. Second operand 3 states and 514 transitions. [2024-10-31 22:13:54,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 180 transitions, 726 flow [2024-10-31 22:13:54,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 180 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:13:54,363 INFO L231 Difference]: Finished difference. Result has 154 places, 173 transitions, 623 flow [2024-10-31 22:13:54,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=623, PETRI_PLACES=154, PETRI_TRANSITIONS=173} [2024-10-31 22:13:54,364 INFO L277 CegarLoopForPetriNet]: 192 programPoint places, -38 predicate places. [2024-10-31 22:13:54,364 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 173 transitions, 623 flow [2024-10-31 22:13:54,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:54,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:54,365 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:13:54,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-31 22:13:54,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 172216935, now seen corresponding path program 1 times [2024-10-31 22:13:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851887201] [2024-10-31 22:13:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:54,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:54,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:54,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:13:54,417 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-31 22:13:54,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-31 22:13:54,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-31 22:13:54,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-31 22:13:54,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-31 22:13:54,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-31 22:13:54,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-31 22:13:54,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-31 22:13:54,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-31 22:13:54,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-31 22:13:54,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-31 22:13:54,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-31 22:13:54,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-31 22:13:54,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-31 22:13:54,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-31 22:13:54,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-31 22:13:54,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:13:54,420 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:54,421 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:13:54,421 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-31 22:13:54,457 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 22:13:54,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 259 transitions, 545 flow [2024-10-31 22:13:54,558 INFO L124 PetriNetUnfolderBase]: 66/567 cut-off events. [2024-10-31 22:13:54,559 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-31 22:13:54,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 567 events. 66/567 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2142 event pairs, 1 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 384. Up to 16 conditions per place. [2024-10-31 22:13:54,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 259 transitions, 545 flow [2024-10-31 22:13:54,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 259 transitions, 545 flow [2024-10-31 22:13:54,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:54,573 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a468146, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:54,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-31 22:13:54,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:13:54,580 INFO L124 PetriNetUnfolderBase]: 3/60 cut-off events. [2024-10-31 22:13:54,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:13:54,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:13:54,581 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:54,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-31 22:13:54,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -957188763, now seen corresponding path program 1 times [2024-10-31 22:13:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:54,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445490021] [2024-10-31 22:13:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445490021] [2024-10-31 22:13:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445490021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970485844] [2024-10-31 22:13:54,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:54,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:55,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 259 [2024-10-31 22:13:55,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 259 transitions, 545 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:55,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:13:55,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 259 [2024-10-31 22:13:55,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand