./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/25_stack_longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/25_stack_longest-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme --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 cabdc6d1ed2adbc421c41fcb971b1cf28c20678c065a4de58d9cc1e3842298d4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:55,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:55,957 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:48:55,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:55,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:55,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:55,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:55,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:55,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:55,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:55,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:55,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:55,999 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:56,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:56,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:56,001 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:56,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:48:56,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:56,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:56,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:56,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:56,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:56,006 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:48:56,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:48:56,007 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:56,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:56,008 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:56,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:56,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:56,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:56,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:56,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:56,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:56,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:56,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:48:56,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:48:56,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:56,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:56,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:56,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:56,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:56,015 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_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/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_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme 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 -> cabdc6d1ed2adbc421c41fcb971b1cf28c20678c065a4de58d9cc1e3842298d4 [2023-11-26 11:48:56,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:56,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:56,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:56,350 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:56,351 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:56,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-ext/25_stack_longest-2.i [2023-11-26 11:48:59,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:49:00,172 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:49:00,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/sv-benchmarks/c/pthread-ext/25_stack_longest-2.i [2023-11-26 11:49:00,205 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/data/5f9006c66/817dd1a564a94ce98f1342930d327f8a/FLAGb6640dad1 [2023-11-26 11:49:00,223 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/data/5f9006c66/817dd1a564a94ce98f1342930d327f8a [2023-11-26 11:49:00,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:49:00,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:49:00,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:49:00,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:49:00,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:49:00,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:49:00" (1/1) ... [2023-11-26 11:49:00,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a11fa9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:00, skipping insertion in model container [2023-11-26 11:49:00,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:49:00" (1/1) ... [2023-11-26 11:49:00,308 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:49:00,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:49:00,978 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:49:01,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:49:01,161 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:49:01,162 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:49:01,172 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:49:01,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01 WrapperNode [2023-11-26 11:49:01,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:49:01,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:49:01,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:49:01,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:49:01,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,297 INFO L138 Inliner]: procedures = 179, calls = 37, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 297 [2023-11-26 11:49:01,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:49:01,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:49:01,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:49:01,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:49:01,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:49:01,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:49:01,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:49:01,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:49:01,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (1/1) ... [2023-11-26 11:49:01,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:49:01,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:49:01,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:49:01,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b76f009-bce7-47fa-8d93-527748bbe150/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:49:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:49:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 11:49:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 11:49:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:49:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:49:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:49:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:49:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:49:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:49:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:49:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:49:01,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:49:01,496 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:49:01,708 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:49:01,711 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:49:02,407 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:49:02,929 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:49:02,929 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:49:02,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:02 BoogieIcfgContainer [2023-11-26 11:49:02,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:49:02,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:49:02,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:49:02,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:49:02,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:49:00" (1/3) ... [2023-11-26 11:49:02,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ff1677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:49:02, skipping insertion in model container [2023-11-26 11:49:02,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:01" (2/3) ... [2023-11-26 11:49:02,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ff1677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:49:02, skipping insertion in model container [2023-11-26 11:49:02,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:02" (3/3) ... [2023-11-26 11:49:02,946 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longest-2.i [2023-11-26 11:49:02,957 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:49:02,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:49:02,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-11-26 11:49:02,970 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:49:03,087 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:49:03,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 156 transitions, 316 flow [2023-11-26 11:49:03,259 INFO L124 PetriNetUnfolderBase]: 8/167 cut-off events. [2023-11-26 11:49:03,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:03,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 167 events. 8/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 247 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-11-26 11:49:03,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 156 transitions, 316 flow [2023-11-26 11:49:03,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 156 transitions, 316 flow [2023-11-26 11:49:03,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:49:03,313 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@725a9598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:49:03,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-26 11:49:03,328 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:49:03,329 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-11-26 11:49:03,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:03,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:03,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:03,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-26 11:49:03,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 487869372, now seen corresponding path program 1 times [2023-11-26 11:49:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:03,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553834312] [2023-11-26 11:49:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:03,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:04,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553834312] [2023-11-26 11:49:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553834312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:04,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:04,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766403272] [2023-11-26 11:49:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:04,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:49:04,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:04,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:49:04,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:49:04,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 156 [2023-11-26 11:49:04,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 156 transitions, 316 flow. Second operand has 2 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:04,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 156 [2023-11-26 11:49:04,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:04,275 INFO L124 PetriNetUnfolderBase]: 4/134 cut-off events. [2023-11-26 11:49:04,275 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:49:04,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 134 events. 4/134 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 10/130 useless extension candidates. Maximal degree in co-relation 118. Up to 11 conditions per place. [2023-11-26 11:49:04,278 INFO L140 encePairwiseOnDemand]: 136/156 looper letters, 10 selfloop transitions, 0 changer transitions 0/130 dead transitions. [2023-11-26 11:49:04,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 284 flow [2023-11-26 11:49:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:49:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 11:49:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 282 transitions. [2023-11-26 11:49:04,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9038461538461539 [2023-11-26 11:49:04,297 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 282 transitions. [2023-11-26 11:49:04,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 282 transitions. [2023-11-26 11:49:04,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:04,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 282 transitions. [2023-11-26 11:49:04,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,315 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,317 INFO L175 Difference]: Start difference. First operand has 152 places, 156 transitions, 316 flow. Second operand 2 states and 282 transitions. [2023-11-26 11:49:04,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 284 flow [2023-11-26 11:49:04,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 130 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:04,327 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 264 flow [2023-11-26 11:49:04,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=264, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2023-11-26 11:49:04,334 INFO L281 CegarLoopForPetriNet]: 152 programPoint places, -22 predicate places. [2023-11-26 11:49:04,334 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 264 flow [2023-11-26 11:49:04,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.0) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:04,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:04,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:49:04,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-26 11:49:04,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:04,337 INFO L85 PathProgramCache]: Analyzing trace with hash 691061119, now seen corresponding path program 1 times [2023-11-26 11:49:04,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387085384] [2023-11-26 11:49:04,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387085384] [2023-11-26 11:49:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387085384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:04,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:04,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152470612] [2023-11-26 11:49:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:04,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 156 [2023-11-26 11:49:04,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:04,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 156 [2023-11-26 11:49:04,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:04,517 INFO L124 PetriNetUnfolderBase]: 6/214 cut-off events. [2023-11-26 11:49:04,518 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:49:04,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 214 events. 6/214 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 390 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 237. Up to 12 conditions per place. [2023-11-26 11:49:04,519 INFO L140 encePairwiseOnDemand]: 153/156 looper letters, 19 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2023-11-26 11:49:04,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 137 transitions, 320 flow [2023-11-26 11:49:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-26 11:49:04,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8290598290598291 [2023-11-26 11:49:04,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-26 11:49:04,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-26 11:49:04,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:04,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-26 11:49:04,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2023-11-26 11:49:04,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,531 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,531 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 264 flow. Second operand 3 states and 388 transitions. [2023-11-26 11:49:04,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 137 transitions, 320 flow [2023-11-26 11:49:04,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 137 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:04,542 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 266 flow [2023-11-26 11:49:04,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2023-11-26 11:49:04,543 INFO L281 CegarLoopForPetriNet]: 152 programPoint places, -21 predicate places. [2023-11-26 11:49:04,544 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 266 flow [2023-11-26 11:49:04,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:04,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:04,547 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:04,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:49:04,552 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2023-11-26 11:49:04,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash -236036508, now seen corresponding path program 1 times [2023-11-26 11:49:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007989621] [2023-11-26 11:49:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:49:04,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:49:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:49:04,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:49:04,649 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:49:04,650 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2023-11-26 11:49:04,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2023-11-26 11:49:04,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2023-11-26 11:49:04,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2023-11-26 11:49:04,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2023-11-26 11:49:04,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2023-11-26 11:49:04,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2023-11-26 11:49:04,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2023-11-26 11:49:04,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2023-11-26 11:49:04,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2023-11-26 11:49:04,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2023-11-26 11:49:04,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2023-11-26 11:49:04,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2023-11-26 11:49:04,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2023-11-26 11:49:04,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2023-11-26 11:49:04,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2023-11-26 11:49:04,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2023-11-26 11:49:04,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2023-11-26 11:49:04,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2023-11-26 11:49:04,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2023-11-26 11:49:04,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2023-11-26 11:49:04,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2023-11-26 11:49:04,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2023-11-26 11:49:04,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2023-11-26 11:49:04,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2023-11-26 11:49:04,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2023-11-26 11:49:04,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2023-11-26 11:49:04,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2023-11-26 11:49:04,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2023-11-26 11:49:04,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2023-11-26 11:49:04,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2023-11-26 11:49:04,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2023-11-26 11:49:04,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2023-11-26 11:49:04,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2023-11-26 11:49:04,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2023-11-26 11:49:04,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2023-11-26 11:49:04,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2023-11-26 11:49:04,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2023-11-26 11:49:04,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2023-11-26 11:49:04,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2023-11-26 11:49:04,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2023-11-26 11:49:04,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2023-11-26 11:49:04,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2023-11-26 11:49:04,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2023-11-26 11:49:04,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2023-11-26 11:49:04,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2023-11-26 11:49:04,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2023-11-26 11:49:04,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2023-11-26 11:49:04,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2023-11-26 11:49:04,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2023-11-26 11:49:04,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2023-11-26 11:49:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2023-11-26 11:49:04,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2023-11-26 11:49:04,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:49:04,666 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-26 11:49:04,669 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:49:04,670 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 11:49:04,815 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:49:04,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 279 transitions, 568 flow [2023-11-26 11:49:04,978 INFO L124 PetriNetUnfolderBase]: 15/303 cut-off events. [2023-11-26 11:49:04,978 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:49:04,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 303 events. 15/303 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 895 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 257. Up to 6 conditions per place. [2023-11-26 11:49:04,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 279 transitions, 568 flow [2023-11-26 11:49:05,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 271 places, 279 transitions, 568 flow [2023-11-26 11:49:05,012 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:49:05,014 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@725a9598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:49:05,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-11-26 11:49:05,022 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:49:05,023 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2023-11-26 11:49:05,023 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:05,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:05,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:05,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 11:49:05,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash -447423914, now seen corresponding path program 1 times [2023-11-26 11:49:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:05,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619502262] [2023-11-26 11:49:05,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:05,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:05,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619502262] [2023-11-26 11:49:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619502262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921344826] [2023-11-26 11:49:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:05,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:49:05,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:49:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:49:05,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 279 [2023-11-26 11:49:05,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 279 transitions, 568 flow. Second operand has 2 states, 2 states have (on average 222.0) internal successors, (444), 2 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:05,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:05,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 279 [2023-11-26 11:49:05,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:05,861 INFO L124 PetriNetUnfolderBase]: 143/1324 cut-off events. [2023-11-26 11:49:05,861 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-26 11:49:05,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 1324 events. 143/1324 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8318 event pairs, 68 based on Foata normal form. 114/1268 useless extension candidates. Maximal degree in co-relation 1375. Up to 211 conditions per place. [2023-11-26 11:49:05,879 INFO L140 encePairwiseOnDemand]: 241/279 looper letters, 20 selfloop transitions, 0 changer transitions 0/234 dead transitions. [2023-11-26 11:49:05,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 234 transitions, 518 flow [2023-11-26 11:49:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:49:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 11:49:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 500 transitions. [2023-11-26 11:49:05,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8960573476702509 [2023-11-26 11:49:05,884 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 500 transitions. [2023-11-26 11:49:05,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 500 transitions. [2023-11-26 11:49:05,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:05,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 500 transitions. [2023-11-26 11:49:05,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.0) internal successors, (500), 2 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:05,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:05,893 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:05,894 INFO L175 Difference]: Start difference. First operand has 271 places, 279 transitions, 568 flow. Second operand 2 states and 500 transitions. [2023-11-26 11:49:05,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 234 transitions, 518 flow [2023-11-26 11:49:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 234 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:05,912 INFO L231 Difference]: Finished difference. Result has 232 places, 234 transitions, 478 flow [2023-11-26 11:49:05,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=232, PETRI_TRANSITIONS=234} [2023-11-26 11:49:05,916 INFO L281 CegarLoopForPetriNet]: 271 programPoint places, -39 predicate places. [2023-11-26 11:49:05,916 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 234 transitions, 478 flow [2023-11-26 11:49:05,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 222.0) internal successors, (444), 2 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:05,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:05,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:05,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:49:05,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 11:49:05,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash -477609031, now seen corresponding path program 1 times [2023-11-26 11:49:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:05,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819501888] [2023-11-26 11:49:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819501888] [2023-11-26 11:49:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819501888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401394954] [2023-11-26 11:49:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:05,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:06,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 279 [2023-11-26 11:49:06,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 234 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:06,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:06,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 279 [2023-11-26 11:49:06,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:06,967 INFO L124 PetriNetUnfolderBase]: 442/3665 cut-off events. [2023-11-26 11:49:06,968 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-11-26 11:49:06,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4418 conditions, 3665 events. 442/3665 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 32509 event pairs, 118 based on Foata normal form. 0/3190 useless extension candidates. Maximal degree in co-relation 4413. Up to 350 conditions per place. [2023-11-26 11:49:07,011 INFO L140 encePairwiseOnDemand]: 271/279 looper letters, 47 selfloop transitions, 6 changer transitions 0/259 dead transitions. [2023-11-26 11:49:07,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 259 transitions, 639 flow [2023-11-26 11:49:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2023-11-26 11:49:07,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8291517323775388 [2023-11-26 11:49:07,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 694 transitions. [2023-11-26 11:49:07,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 694 transitions. [2023-11-26 11:49:07,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:07,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 694 transitions. [2023-11-26 11:49:07,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:07,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:07,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:07,023 INFO L175 Difference]: Start difference. First operand has 232 places, 234 transitions, 478 flow. Second operand 3 states and 694 transitions. [2023-11-26 11:49:07,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 259 transitions, 639 flow [2023-11-26 11:49:07,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 259 transitions, 639 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:07,030 INFO L231 Difference]: Finished difference. Result has 236 places, 240 transitions, 530 flow [2023-11-26 11:49:07,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=236, PETRI_TRANSITIONS=240} [2023-11-26 11:49:07,033 INFO L281 CegarLoopForPetriNet]: 271 programPoint places, -35 predicate places. [2023-11-26 11:49:07,033 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 240 transitions, 530 flow [2023-11-26 11:49:07,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:07,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:07,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:07,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:49:07,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 11:49:07,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -527345300, now seen corresponding path program 1 times [2023-11-26 11:49:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410635623] [2023-11-26 11:49:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410635623] [2023-11-26 11:49:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410635623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43345628] [2023-11-26 11:49:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:07,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:07,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 279 [2023-11-26 11:49:07,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 240 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:07,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:07,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 279 [2023-11-26 11:49:07,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:08,310 INFO L124 PetriNetUnfolderBase]: 683/4461 cut-off events. [2023-11-26 11:49:08,310 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-26 11:49:08,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 4461 events. 683/4461 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 41091 event pairs, 283 based on Foata normal form. 0/3855 useless extension candidates. Maximal degree in co-relation 5714. Up to 996 conditions per place. [2023-11-26 11:49:08,358 INFO L140 encePairwiseOnDemand]: 271/279 looper letters, 37 selfloop transitions, 7 changer transitions 0/254 dead transitions. [2023-11-26 11:49:08,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 254 transitions, 651 flow [2023-11-26 11:49:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2023-11-26 11:49:08,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8100358422939068 [2023-11-26 11:49:08,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 678 transitions. [2023-11-26 11:49:08,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 678 transitions. [2023-11-26 11:49:08,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:08,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 678 transitions. [2023-11-26 11:49:08,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:08,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:08,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:08,368 INFO L175 Difference]: Start difference. First operand has 236 places, 240 transitions, 530 flow. Second operand 3 states and 678 transitions. [2023-11-26 11:49:08,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 254 transitions, 651 flow [2023-11-26 11:49:08,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 254 transitions, 639 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:08,379 INFO L231 Difference]: Finished difference. Result has 238 places, 246 transitions, 572 flow [2023-11-26 11:49:08,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=238, PETRI_TRANSITIONS=246} [2023-11-26 11:49:08,383 INFO L281 CegarLoopForPetriNet]: 271 programPoint places, -33 predicate places. [2023-11-26 11:49:08,383 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 246 transitions, 572 flow [2023-11-26 11:49:08,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:08,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:08,384 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:08,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:49:08,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 11:49:08,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash 454496179, now seen corresponding path program 1 times [2023-11-26 11:49:08,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:08,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355263032] [2023-11-26 11:49:08,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:08,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:49:08,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:49:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:49:08,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:49:08,440 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:49:08,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2023-11-26 11:49:08,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2023-11-26 11:49:08,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2023-11-26 11:49:08,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2023-11-26 11:49:08,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2023-11-26 11:49:08,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2023-11-26 11:49:08,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2023-11-26 11:49:08,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2023-11-26 11:49:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2023-11-26 11:49:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2023-11-26 11:49:08,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2023-11-26 11:49:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2023-11-26 11:49:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2023-11-26 11:49:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2023-11-26 11:49:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2023-11-26 11:49:08,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2023-11-26 11:49:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2023-11-26 11:49:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2023-11-26 11:49:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2023-11-26 11:49:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2023-11-26 11:49:08,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2023-11-26 11:49:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2023-11-26 11:49:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2023-11-26 11:49:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2023-11-26 11:49:08,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2023-11-26 11:49:08,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2023-11-26 11:49:08,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2023-11-26 11:49:08,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2023-11-26 11:49:08,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2023-11-26 11:49:08,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2023-11-26 11:49:08,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2023-11-26 11:49:08,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2023-11-26 11:49:08,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2023-11-26 11:49:08,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2023-11-26 11:49:08,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2023-11-26 11:49:08,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2023-11-26 11:49:08,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2023-11-26 11:49:08,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2023-11-26 11:49:08,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2023-11-26 11:49:08,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2023-11-26 11:49:08,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2023-11-26 11:49:08,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2023-11-26 11:49:08,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2023-11-26 11:49:08,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2023-11-26 11:49:08,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2023-11-26 11:49:08,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2023-11-26 11:49:08,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2023-11-26 11:49:08,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2023-11-26 11:49:08,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2023-11-26 11:49:08,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2023-11-26 11:49:08,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2023-11-26 11:49:08,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2023-11-26 11:49:08,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2023-11-26 11:49:08,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2023-11-26 11:49:08,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2023-11-26 11:49:08,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2023-11-26 11:49:08,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2023-11-26 11:49:08,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2023-11-26 11:49:08,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2023-11-26 11:49:08,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2023-11-26 11:49:08,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2023-11-26 11:49:08,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2023-11-26 11:49:08,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2023-11-26 11:49:08,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2023-11-26 11:49:08,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2023-11-26 11:49:08,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2023-11-26 11:49:08,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2023-11-26 11:49:08,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2023-11-26 11:49:08,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2023-11-26 11:49:08,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2023-11-26 11:49:08,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2023-11-26 11:49:08,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2023-11-26 11:49:08,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2023-11-26 11:49:08,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2023-11-26 11:49:08,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2023-11-26 11:49:08,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2023-11-26 11:49:08,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2023-11-26 11:49:08,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2023-11-26 11:49:08,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2023-11-26 11:49:08,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:49:08,470 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:49:08,470 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:49:08,470 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 11:49:08,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:49:08,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 390 places, 402 transitions, 822 flow [2023-11-26 11:49:08,845 INFO L124 PetriNetUnfolderBase]: 22/439 cut-off events. [2023-11-26 11:49:08,845 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 11:49:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 439 events. 22/439 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1656 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 379. Up to 8 conditions per place. [2023-11-26 11:49:08,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 390 places, 402 transitions, 822 flow [2023-11-26 11:49:08,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 390 places, 402 transitions, 822 flow [2023-11-26 11:49:08,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:49:08,874 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@725a9598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:49:08,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-11-26 11:49:08,878 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:49:08,878 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2023-11-26 11:49:08,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:08,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:08,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:08,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-26 11:49:08,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2130399632, now seen corresponding path program 1 times [2023-11-26 11:49:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74323205] [2023-11-26 11:49:08,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74323205] [2023-11-26 11:49:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74323205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138302655] [2023-11-26 11:49:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:09,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:49:09,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:49:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:49:09,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 402 [2023-11-26 11:49:09,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 402 transitions, 822 flow. Second operand has 2 states, 2 states have (on average 317.0) internal successors, (634), 2 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:09,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:09,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 402 [2023-11-26 11:49:09,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:12,851 INFO L124 PetriNetUnfolderBase]: 2611/14070 cut-off events. [2023-11-26 11:49:12,851 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-11-26 11:49:13,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17743 conditions, 14070 events. 2611/14070 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 156834 event pairs, 1444 based on Foata normal form. 1346/13723 useless extension candidates. Maximal degree in co-relation 15700. Up to 3323 conditions per place. [2023-11-26 11:49:13,146 INFO L140 encePairwiseOnDemand]: 346/402 looper letters, 30 selfloop transitions, 0 changer transitions 0/338 dead transitions. [2023-11-26 11:49:13,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 338 transitions, 754 flow [2023-11-26 11:49:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:49:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-26 11:49:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 718 transitions. [2023-11-26 11:49:13,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8930348258706468 [2023-11-26 11:49:13,150 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 718 transitions. [2023-11-26 11:49:13,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 718 transitions. [2023-11-26 11:49:13,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:13,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 718 transitions. [2023-11-26 11:49:13,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 359.0) internal successors, (718), 2 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:13,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:13,158 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:13,159 INFO L175 Difference]: Start difference. First operand has 390 places, 402 transitions, 822 flow. Second operand 2 states and 718 transitions. [2023-11-26 11:49:13,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 338 transitions, 754 flow [2023-11-26 11:49:13,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 338 transitions, 752 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:13,170 INFO L231 Difference]: Finished difference. Result has 334 places, 338 transitions, 692 flow [2023-11-26 11:49:13,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=692, PETRI_PLACES=334, PETRI_TRANSITIONS=338} [2023-11-26 11:49:13,172 INFO L281 CegarLoopForPetriNet]: 390 programPoint places, -56 predicate places. [2023-11-26 11:49:13,172 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 338 transitions, 692 flow [2023-11-26 11:49:13,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 317.0) internal successors, (634), 2 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:13,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:13,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:13,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:49:13,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-26 11:49:13,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1385298253, now seen corresponding path program 1 times [2023-11-26 11:49:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999028506] [2023-11-26 11:49:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999028506] [2023-11-26 11:49:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999028506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711939196] [2023-11-26 11:49:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:13,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:13,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 402 [2023-11-26 11:49:13,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 338 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:13,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:13,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 402 [2023-11-26 11:49:13,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:26,892 INFO L124 PetriNetUnfolderBase]: 12428/61093 cut-off events. [2023-11-26 11:49:26,892 INFO L125 PetriNetUnfolderBase]: For 874/874 co-relation queries the response was YES. [2023-11-26 11:49:27,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78429 conditions, 61093 events. 12428/61093 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 878584 event pairs, 3677 based on Foata normal form. 0/53105 useless extension candidates. Maximal degree in co-relation 78423. Up to 8338 conditions per place. [2023-11-26 11:49:27,754 INFO L140 encePairwiseOnDemand]: 390/402 looper letters, 71 selfloop transitions, 9 changer transitions 0/376 dead transitions. [2023-11-26 11:49:27,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 376 transitions, 938 flow [2023-11-26 11:49:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2023-11-26 11:49:27,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8250414593698175 [2023-11-26 11:49:27,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 995 transitions. [2023-11-26 11:49:27,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 995 transitions. [2023-11-26 11:49:27,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:27,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 995 transitions. [2023-11-26 11:49:27,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.6666666666667) internal successors, (995), 3 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:27,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:27,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:27,770 INFO L175 Difference]: Start difference. First operand has 334 places, 338 transitions, 692 flow. Second operand 3 states and 995 transitions. [2023-11-26 11:49:27,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 376 transitions, 938 flow [2023-11-26 11:49:27,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 376 transitions, 938 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:49:27,785 INFO L231 Difference]: Finished difference. Result has 338 places, 347 transitions, 770 flow [2023-11-26 11:49:27,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=338, PETRI_TRANSITIONS=347} [2023-11-26 11:49:27,787 INFO L281 CegarLoopForPetriNet]: 390 programPoint places, -52 predicate places. [2023-11-26 11:49:27,787 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 347 transitions, 770 flow [2023-11-26 11:49:27,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:27,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:27,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:27,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:49:27,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-26 11:49:27,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 123083780, now seen corresponding path program 1 times [2023-11-26 11:49:27,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:27,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302113097] [2023-11-26 11:49:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:27,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:27,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302113097] [2023-11-26 11:49:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302113097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:27,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:27,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607953216] [2023-11-26 11:49:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:27,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:27,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 402 [2023-11-26 11:49:27,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 347 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:27,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:27,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 402 [2023-11-26 11:49:27,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:30,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 66#L770-3true, 393#true, 402#true, 188#L718true]) [2023-11-26 11:49:30,597 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-26 11:49:30,597 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-26 11:49:30,598 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 11:49:30,598 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-26 11:49:30,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 135#L768true, 66#L770-3true, 393#true, 402#true]) [2023-11-26 11:49:30,693 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-26 11:49:30,693 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-26 11:49:30,693 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 11:49:30,693 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-26 11:49:33,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, 30#L770-3true, Black: 398#(= |#race~state~0| 0), 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 226#L707-3true, 393#true, 402#true, 188#L718true]) [2023-11-26 11:49:33,501 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-26 11:49:33,501 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 11:49:33,501 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-26 11:49:33,501 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-26 11:49:33,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [30#L770-3true, 113#L779-5true, Black: 398#(= |#race~state~0| 0), 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 135#L768true, 226#L707-3true, 402#true, 393#true]) [2023-11-26 11:49:33,886 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-26 11:49:33,887 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-26 11:49:33,887 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-26 11:49:33,887 INFO L297 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2023-11-26 11:49:34,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 19#L709-3true, 393#true, 402#true, 188#L718true]) [2023-11-26 11:49:34,614 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2023-11-26 11:49:34,614 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-26 11:49:34,614 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-26 11:49:34,615 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 11:49:34,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 135#L768true, 19#L709-3true, 393#true, 402#true]) [2023-11-26 11:49:34,833 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-26 11:49:34,833 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-26 11:49:34,833 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 11:49:34,834 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-26 11:49:37,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [30#L770-3true, 113#L779-5true, Black: 398#(= |#race~state~0| 0), 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 300#L734-3true, 402#true, 393#true, 188#L718true]) [2023-11-26 11:49:37,546 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-26 11:49:37,546 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-26 11:49:37,546 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 11:49:37,546 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2023-11-26 11:49:37,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [30#L770-3true, 113#L779-5true, Black: 398#(= |#race~state~0| 0), 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 135#L768true, 300#L734-3true, 402#true, 393#true]) [2023-11-26 11:49:37,681 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-26 11:49:37,681 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:49:37,681 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 11:49:37,681 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 11:49:37,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 85#L735true, thr1Thread3of3ForFork0InUse, 393#true, 402#true, 188#L718true]) [2023-11-26 11:49:37,683 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-26 11:49:37,683 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 11:49:37,683 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-26 11:49:37,684 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:49:37,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 85#L735true, thr1Thread3of3ForFork0InUse, 135#L768true, 393#true, 402#true]) [2023-11-26 11:49:37,820 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2023-11-26 11:49:37,820 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:49:37,820 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:49:37,820 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 11:49:39,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 318#L739true, 393#true, 402#true, 188#L718true]) [2023-11-26 11:49:39,103 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-26 11:49:39,104 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-26 11:49:39,104 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-26 11:49:39,104 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2023-11-26 11:49:39,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 135#L768true, 318#L739true, 393#true, 402#true]) [2023-11-26 11:49:39,294 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:49:39,295 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:49:39,295 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:49:39,295 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:49:39,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, 170#L740-2true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 393#true, 402#true, 188#L718true]) [2023-11-26 11:49:39,296 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:49:39,297 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:49:39,297 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 11:49:39,297 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:49:39,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1569] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_424|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][121], [113#L779-5true, Black: 398#(= |#race~state~0| 0), 30#L770-3true, 396#true, thr1Thread1of3ForFork0InUse, 170#L740-2true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 135#L768true, 393#true, 402#true]) [2023-11-26 11:49:39,475 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-26 11:49:39,475 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-26 11:49:39,476 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:49:39,476 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:49:44,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1813] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, #memory_int=|v_#memory_int_424|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][75], [Black: 398#(= |#race~state~0| 0), 113#L779-5true, 396#true, 114#L739true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 66#L770-3true, 109#L756-3true, 402#true, 393#true]) [2023-11-26 11:49:44,739 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-26 11:49:44,739 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:49:44,739 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 11:49:44,740 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-26 11:49:44,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1813] L770-->L770-3: Formula: (let ((.cse2 (select |v_#race_719| |v_~#m2~0.base_31|))) (let ((.cse0 (select |v_#memory_int_425| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 1)) (.cse5 (+ |v_~#m2~0.offset_31| 3)) (.cse4 (+ |v_~#m2~0.offset_31| 2)) (.cse1 (select .cse2 |v_~#m2~0.offset_31|))) (and (= (store |v_#memory_int_425| |v_~#m2~0.base_31| (store .cse0 |v_~#m2~0.offset_31| 0)) |v_#memory_int_424|) (not (= (ite (= (select .cse0 |v_~#m2~0.offset_31|) 1) 1 0) 0)) (= .cse1 (select .cse2 .cse3)) (= (store |v_#race_721| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_721| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse1) .cse3 .cse1) .cse4 .cse1) .cse5 .cse1)) |v_#race_719|) (= (select .cse2 .cse5) .cse1) (= (select .cse2 .cse4) .cse1)))) InVars {#race=|v_#race_721|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_719|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, #memory_int=|v_#memory_int_424|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][75], [Black: 398#(= |#race~state~0| 0), 113#L779-5true, 396#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 66#L770-3true, 109#L756-3true, 340#L740-2true, 393#true, 402#true]) [2023-11-26 11:49:44,865 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-26 11:49:44,865 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 11:49:44,865 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:49:44,865 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-26 11:49:46,645 INFO L124 PetriNetUnfolderBase]: 21422/92980 cut-off events. [2023-11-26 11:49:46,645 INFO L125 PetriNetUnfolderBase]: For 1890/1890 co-relation queries the response was YES. [2023-11-26 11:49:47,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124708 conditions, 92980 events. 21422/92980 cut-off events. For 1890/1890 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 1398671 event pairs, 10174 based on Foata normal form. 0/80682 useless extension candidates. Maximal degree in co-relation 124700. Up to 26287 conditions per place. [2023-11-26 11:49:48,471 INFO L140 encePairwiseOnDemand]: 390/402 looper letters, 57 selfloop transitions, 11 changer transitions 0/373 dead transitions. [2023-11-26 11:49:48,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 373 transitions, 968 flow [2023-11-26 11:49:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2023-11-26 11:49:48,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8134328358208955 [2023-11-26 11:49:48,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 981 transitions. [2023-11-26 11:49:48,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 981 transitions. [2023-11-26 11:49:48,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:48,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 981 transitions. [2023-11-26 11:49:48,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:48,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:48,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 402.0) internal successors, (1608), 4 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:48,486 INFO L175 Difference]: Start difference. First operand has 338 places, 347 transitions, 770 flow. Second operand 3 states and 981 transitions. [2023-11-26 11:49:48,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 373 transitions, 968 flow [2023-11-26 11:49:48,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 373 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:48,511 INFO L231 Difference]: Finished difference. Result has 340 places, 357 transitions, 838 flow [2023-11-26 11:49:48,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=402, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=340, PETRI_TRANSITIONS=357} [2023-11-26 11:49:48,514 INFO L281 CegarLoopForPetriNet]: 390 programPoint places, -50 predicate places. [2023-11-26 11:49:48,515 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 357 transitions, 838 flow [2023-11-26 11:49:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:48,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:48,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:48,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:49:48,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2023-11-26 11:49:48,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1685095987, now seen corresponding path program 1 times [2023-11-26 11:49:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974095519] [2023-11-26 11:49:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:48,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:49:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974095519] [2023-11-26 11:49:48,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974095519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:48,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353590975] [2023-11-26 11:49:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:48,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:48,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:48,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 402 [2023-11-26 11:49:48,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 357 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 308.0) internal successors, (924), 3 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:48,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:48,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 402 [2023-11-26 11:49:48,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand