./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/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_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/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_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/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 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:02:53,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:02:53,780 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 12:02:53,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:02:53,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:02:53,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:02:53,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:02:53,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:02:53,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:02:53,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:02:53,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:02:53,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:02:53,819 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:02:53,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:02:53,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:02:53,821 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:02:53,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:02:53,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:02:53,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:02:53,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:02:53,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:02:53,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:02:53,825 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 12:02:53,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 12:02:53,826 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:02:53,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:02:53,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:02:53,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:02:53,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:02:53,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:02:53,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:53,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:02:53,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:02:53,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:02:53,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:02:53,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:02:53,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:02:53,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:02:53,833 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:02:53,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:02:53,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:02:53,834 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_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/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_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/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 -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2023-11-26 12:02:54,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:02:54,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:02:54,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:02:54,112 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:02:54,113 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:02:54,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2023-11-26 12:02:57,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:02:57,626 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:02:57,627 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2023-11-26 12:02:57,646 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/data/9ef5e3fd2/acba39d3f9604ab6a5eca96ec1d12eff/FLAG454458b3d [2023-11-26 12:02:57,661 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/data/9ef5e3fd2/acba39d3f9604ab6a5eca96ec1d12eff [2023-11-26 12:02:57,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:02:57,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:02:57,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:57,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:02:57,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:02:57,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:57" (1/1) ... [2023-11-26 12:02:57,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73af51b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:57, skipping insertion in model container [2023-11-26 12:02:57,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:02:57" (1/1) ... [2023-11-26 12:02:57,742 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:02:58,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:58,120 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:02:58,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:02:58,231 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:02:58,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58 WrapperNode [2023-11-26 12:02:58,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:02:58,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:58,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:02:58,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:02:58,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,308 INFO L138 Inliner]: procedures = 172, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2023-11-26 12:02:58,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:02:58,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:02:58,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:02:58,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:02:58,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:02:58,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:02:58,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:02:58,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:02:58,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (1/1) ... [2023-11-26 12:02:58,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:02:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:02:58,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:02:58,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:02:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-26 12:02:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-26 12:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-26 12:02:58,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-26 12:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 12:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-26 12:02:58,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:02:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:02:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:02:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 12:02:58,492 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-26 12:02:58,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:02:58,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:02:58,494 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 12:02:58,713 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:02:58,716 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:02:59,002 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:02:59,025 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:02:59,025 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 12:02:59,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:59 BoogieIcfgContainer [2023-11-26 12:02:59,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:02:59,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:02:59,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:02:59,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:02:59,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:02:57" (1/3) ... [2023-11-26 12:02:59,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224a57a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:59, skipping insertion in model container [2023-11-26 12:02:59,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:02:58" (2/3) ... [2023-11-26 12:02:59,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224a57a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:02:59, skipping insertion in model container [2023-11-26 12:02:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:59" (3/3) ... [2023-11-26 12:02:59,037 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2023-11-26 12:02:59,046 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:02:59,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:02:59,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-26 12:02:59,059 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:02:59,138 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:02:59,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 143 transitions, 294 flow [2023-11-26 12:02:59,301 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2023-11-26 12:02:59,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:59,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 161 events. 8/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 232 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 105. Up to 4 conditions per place. [2023-11-26 12:02:59,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 143 transitions, 294 flow [2023-11-26 12:02:59,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 142 transitions, 291 flow [2023-11-26 12:02:59,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:02:59,336 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;@4f889a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:02:59,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-26 12:02:59,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:02:59,345 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 12:02:59,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:02:59,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:59,346 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] [2023-11-26 12:02:59,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-26 12:02:59,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:59,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1743213872, now seen corresponding path program 1 times [2023-11-26 12:02:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033483559] [2023-11-26 12:02:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:59,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:02:59,651 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 12:02:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:02:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033483559] [2023-11-26 12:02:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033483559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:02:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:02:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:02:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202563888] [2023-11-26 12:02:59,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:02:59,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:02:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:02:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:02:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:02:59,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2023-11-26 12:02:59,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 142 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 12:02:59,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:02:59,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2023-11-26 12:02:59,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:02:59,858 INFO L124 PetriNetUnfolderBase]: 23/322 cut-off events. [2023-11-26 12:02:59,859 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 12:02:59,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 322 events. 23/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1244 event pairs, 19 based on Foata normal form. 38/305 useless extension candidates. Maximal degree in co-relation 312. Up to 47 conditions per place. [2023-11-26 12:02:59,865 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 11 selfloop transitions, 2 changer transitions 1/133 dead transitions. [2023-11-26 12:02:59,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 133 transitions, 299 flow [2023-11-26 12:02:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:02:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:02:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-11-26 12:02:59,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9044289044289044 [2023-11-26 12:02:59,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-11-26 12:02:59,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-11-26 12:02:59,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:02:59,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-11-26 12:02:59,894 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 12:02:59,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:02:59,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:02:59,903 INFO L175 Difference]: Start difference. First operand has 141 places, 142 transitions, 291 flow. Second operand 3 states and 388 transitions. [2023-11-26 12:02:59,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 133 transitions, 299 flow [2023-11-26 12:02:59,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:02:59,913 INFO L231 Difference]: Finished difference. Result has 138 places, 132 transitions, 274 flow [2023-11-26 12:02:59,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=138, PETRI_TRANSITIONS=132} [2023-11-26 12:02:59,920 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2023-11-26 12:02:59,920 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 132 transitions, 274 flow [2023-11-26 12:02:59,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 12:02:59,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:02:59,921 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] [2023-11-26 12:02:59,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:02:59,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-26 12:02:59,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:02:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1180355068, now seen corresponding path program 1 times [2023-11-26 12:02:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:02:59,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854287540] [2023-11-26 12:02:59,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:02:59,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:02:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:00,091 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 12:03:00,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:00,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854287540] [2023-11-26 12:03:00,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854287540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761510031] [2023-11-26 12:03:00,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:00,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:00,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 143 [2023-11-26 12:03:00,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 132 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 12:03:00,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:00,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 143 [2023-11-26 12:03:00,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:00,245 INFO L124 PetriNetUnfolderBase]: 29/364 cut-off events. [2023-11-26 12:03:00,245 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 12:03:00,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 364 events. 29/364 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1472 event pairs, 26 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 406. Up to 62 conditions per place. [2023-11-26 12:03:00,250 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 13 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2023-11-26 12:03:00,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 302 flow [2023-11-26 12:03:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-11-26 12:03:00,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8834498834498834 [2023-11-26 12:03:00,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-11-26 12:03:00,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-11-26 12:03:00,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:00,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-11-26 12:03:00,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 12:03:00,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:03:00,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:03:00,261 INFO L175 Difference]: Start difference. First operand has 138 places, 132 transitions, 274 flow. Second operand 3 states and 379 transitions. [2023-11-26 12:03:00,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 302 flow [2023-11-26 12:03:00,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:00,266 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 272 flow [2023-11-26 12:03:00,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2023-11-26 12:03:00,268 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -5 predicate places. [2023-11-26 12:03:00,268 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 272 flow [2023-11-26 12:03:00,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 12:03:00,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:00,270 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 12:03:00,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:03:00,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-26 12:03:00,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1474546595, now seen corresponding path program 1 times [2023-11-26 12:03:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675697090] [2023-11-26 12:03:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:00,349 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 12:03:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675697090] [2023-11-26 12:03:00,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675697090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:00,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099756507] [2023-11-26 12:03:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:00,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:00,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2023-11-26 12:03:00,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:00,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:00,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2023-11-26 12:03:00,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:00,550 INFO L124 PetriNetUnfolderBase]: 68/535 cut-off events. [2023-11-26 12:03:00,551 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 12:03:00,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 535 events. 68/535 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2793 event pairs, 58 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 626. Up to 116 conditions per place. [2023-11-26 12:03:00,559 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 14 selfloop transitions, 1 changer transitions 0/126 dead transitions. [2023-11-26 12:03:00,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 126 transitions, 292 flow [2023-11-26 12:03:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-26 12:03:00,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8648018648018648 [2023-11-26 12:03:00,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-26 12:03:00,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-26 12:03:00,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:00,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-26 12:03:00,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:00,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:03:00,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:03:00,567 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 272 flow. Second operand 3 states and 371 transitions. [2023-11-26 12:03:00,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 126 transitions, 292 flow [2023-11-26 12:03:00,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 126 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:00,572 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 260 flow [2023-11-26 12:03:00,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2023-11-26 12:03:00,575 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -10 predicate places. [2023-11-26 12:03:00,575 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 260 flow [2023-11-26 12:03:00,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:00,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:00,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:00,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:03:00,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-26 12:03:00,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1398581886, now seen corresponding path program 1 times [2023-11-26 12:03:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:00,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773365170] [2023-11-26 12:03:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:00,720 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 12:03:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:00,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773365170] [2023-11-26 12:03:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773365170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:00,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411180678] [2023-11-26 12:03:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:00,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:00,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:00,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:00,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 143 [2023-11-26 12:03:00,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 12:03:00,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:00,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 143 [2023-11-26 12:03:00,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:00,810 INFO L124 PetriNetUnfolderBase]: 17/242 cut-off events. [2023-11-26 12:03:00,810 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 12:03:00,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 242 events. 17/242 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 627 event pairs, 4 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 260. Up to 32 conditions per place. [2023-11-26 12:03:00,812 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 13 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2023-11-26 12:03:00,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 131 transitions, 307 flow [2023-11-26 12:03:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:00,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-26 12:03:00,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9184149184149184 [2023-11-26 12:03:00,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-26 12:03:00,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-26 12:03:00,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:00,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-26 12:03:00,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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 12:03:00,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:03:00,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 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 12:03:00,821 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 260 flow. Second operand 3 states and 394 transitions. [2023-11-26 12:03:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 131 transitions, 307 flow [2023-11-26 12:03:00,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 131 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:00,825 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 287 flow [2023-11-26 12:03:00,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2023-11-26 12:03:00,827 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2023-11-26 12:03:00,827 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 287 flow [2023-11-26 12:03:00,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 12:03:00,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:00,828 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:00,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:03:00,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-26 12:03:00,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1186562035, now seen corresponding path program 1 times [2023-11-26 12:03:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:00,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353904728] [2023-11-26 12:03:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 12:03:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353904728] [2023-11-26 12:03:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353904728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:01,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:01,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003983123] [2023-11-26 12:03:01,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:01,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:01,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:01,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:01,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 143 [2023-11-26 12:03:01,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 12:03:01,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:01,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 143 [2023-11-26 12:03:01,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:01,245 INFO L124 PetriNetUnfolderBase]: 12/288 cut-off events. [2023-11-26 12:03:01,245 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-26 12:03:01,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 288 events. 12/288 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 921 event pairs, 8 based on Foata normal form. 1/265 useless extension candidates. Maximal degree in co-relation 333. Up to 34 conditions per place. [2023-11-26 12:03:01,248 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 16 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2023-11-26 12:03:01,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 333 flow [2023-11-26 12:03:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:03:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:03:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-11-26 12:03:01,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2023-11-26 12:03:01,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-11-26 12:03:01,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-11-26 12:03:01,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:01,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-11-26 12:03:01,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 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 12:03:01,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 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 12:03:01,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 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 12:03:01,263 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 287 flow. Second operand 5 states and 616 transitions. [2023-11-26 12:03:01,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 333 flow [2023-11-26 12:03:01,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 131 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:01,269 INFO L231 Difference]: Finished difference. Result has 138 places, 127 transitions, 283 flow [2023-11-26 12:03:01,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2023-11-26 12:03:01,273 INFO L281 CegarLoopForPetriNet]: 141 programPoint places, -3 predicate places. [2023-11-26 12:03:01,274 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 283 flow [2023-11-26 12:03:01,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 12:03:01,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:01,276 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:03:01,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-26 12:03:01,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -736873221, now seen corresponding path program 1 times [2023-11-26 12:03:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146224868] [2023-11-26 12:03:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:01,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:01,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:01,470 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:03:01,471 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-26 12:03:01,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2023-11-26 12:03:01,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2023-11-26 12:03:01,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2023-11-26 12:03:01,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2023-11-26 12:03:01,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2023-11-26 12:03:01,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2023-11-26 12:03:01,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2023-11-26 12:03:01,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2023-11-26 12:03:01,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2023-11-26 12:03:01,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2023-11-26 12:03:01,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2023-11-26 12:03:01,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2023-11-26 12:03:01,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2023-11-26 12:03:01,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2023-11-26 12:03:01,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2023-11-26 12:03:01,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2023-11-26 12:03:01,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:03:01,485 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 12:03:01,488 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 12:03:01,488 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 12:03:01,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:03:01,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 200 transitions, 420 flow [2023-11-26 12:03:01,613 INFO L124 PetriNetUnfolderBase]: 11/219 cut-off events. [2023-11-26 12:03:01,613 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 12:03:01,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 219 events. 11/219 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 425 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 226. Up to 6 conditions per place. [2023-11-26 12:03:01,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 200 transitions, 420 flow [2023-11-26 12:03:01,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 176 transitions, 365 flow [2023-11-26 12:03:01,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:03:01,622 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;@4f889a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:03:01,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-26 12:03:01,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:03:01,626 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 12:03:01,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:03:01,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:01,627 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] [2023-11-26 12:03:01,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:01,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash -104759400, now seen corresponding path program 1 times [2023-11-26 12:03:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:01,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143226506] [2023-11-26 12:03:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:01,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:01,672 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 12:03:01,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143226506] [2023-11-26 12:03:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143226506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:01,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:01,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:01,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517676121] [2023-11-26 12:03:01,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:01,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:01,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 200 [2023-11-26 12:03:01,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 176 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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 12:03:01,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:01,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 200 [2023-11-26 12:03:01,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:02,016 INFO L124 PetriNetUnfolderBase]: 216/1084 cut-off events. [2023-11-26 12:03:02,016 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 12:03:02,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 1084 events. 216/1084 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7428 event pairs, 189 based on Foata normal form. 226/1131 useless extension candidates. Maximal degree in co-relation 1374. Up to 317 conditions per place. [2023-11-26 12:03:02,032 INFO L140 encePairwiseOnDemand]: 191/200 looper letters, 16 selfloop transitions, 2 changer transitions 1/166 dead transitions. [2023-11-26 12:03:02,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 166 transitions, 381 flow [2023-11-26 12:03:02,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2023-11-26 12:03:02,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2023-11-26 12:03:02,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2023-11-26 12:03:02,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2023-11-26 12:03:02,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:02,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2023-11-26 12:03:02,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:02,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:02,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:02,043 INFO L175 Difference]: Start difference. First operand has 175 places, 176 transitions, 365 flow. Second operand 3 states and 532 transitions. [2023-11-26 12:03:02,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 166 transitions, 381 flow [2023-11-26 12:03:02,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 166 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:02,048 INFO L231 Difference]: Finished difference. Result has 172 places, 165 transitions, 346 flow [2023-11-26 12:03:02,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=165} [2023-11-26 12:03:02,052 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2023-11-26 12:03:02,052 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 165 transitions, 346 flow [2023-11-26 12:03:02,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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 12:03:02,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:02,054 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] [2023-11-26 12:03:02,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:03:02,057 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:02,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 664564676, now seen corresponding path program 1 times [2023-11-26 12:03:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285934698] [2023-11-26 12:03:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:02,113 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 12:03:02,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285934698] [2023-11-26 12:03:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285934698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:02,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563042176] [2023-11-26 12:03:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:02,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:02,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2023-11-26 12:03:02,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 165 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:02,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:02,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2023-11-26 12:03:02,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:02,551 INFO L124 PetriNetUnfolderBase]: 200/1658 cut-off events. [2023-11-26 12:03:02,551 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-26 12:03:02,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1658 events. 200/1658 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12906 event pairs, 194 based on Foata normal form. 0/1410 useless extension candidates. Maximal degree in co-relation 1988. Up to 326 conditions per place. [2023-11-26 12:03:02,572 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 17 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-11-26 12:03:02,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 164 transitions, 382 flow [2023-11-26 12:03:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-11-26 12:03:02,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2023-11-26 12:03:02,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-11-26 12:03:02,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-11-26 12:03:02,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:02,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-11-26 12:03:02,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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 12:03:02,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:02,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:02,583 INFO L175 Difference]: Start difference. First operand has 172 places, 165 transitions, 346 flow. Second operand 3 states and 524 transitions. [2023-11-26 12:03:02,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 164 transitions, 382 flow [2023-11-26 12:03:02,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 164 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:02,590 INFO L231 Difference]: Finished difference. Result has 170 places, 164 transitions, 344 flow [2023-11-26 12:03:02,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=170, PETRI_TRANSITIONS=164} [2023-11-26 12:03:02,592 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -5 predicate places. [2023-11-26 12:03:02,592 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 164 transitions, 344 flow [2023-11-26 12:03:02,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:02,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:02,593 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 12:03:02,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:03:02,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:02,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1505864741, now seen corresponding path program 1 times [2023-11-26 12:03:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:02,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121347147] [2023-11-26 12:03:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:02,647 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 12:03:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121347147] [2023-11-26 12:03:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121347147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038866638] [2023-11-26 12:03:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:02,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 200 [2023-11-26 12:03:02,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 164 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:02,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:02,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 200 [2023-11-26 12:03:02,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:03,184 INFO L124 PetriNetUnfolderBase]: 590/2629 cut-off events. [2023-11-26 12:03:03,185 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-26 12:03:03,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3481 conditions, 2629 events. 590/2629 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 22634 event pairs, 508 based on Foata normal form. 0/2308 useless extension candidates. Maximal degree in co-relation 3440. Up to 791 conditions per place. [2023-11-26 12:03:03,215 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 19 selfloop transitions, 1 changer transitions 0/158 dead transitions. [2023-11-26 12:03:03,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 158 transitions, 372 flow [2023-11-26 12:03:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2023-11-26 12:03:03,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8433333333333334 [2023-11-26 12:03:03,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2023-11-26 12:03:03,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2023-11-26 12:03:03,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:03,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2023-11-26 12:03:03,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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 12:03:03,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:03,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:03,224 INFO L175 Difference]: Start difference. First operand has 170 places, 164 transitions, 344 flow. Second operand 3 states and 506 transitions. [2023-11-26 12:03:03,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 158 transitions, 372 flow [2023-11-26 12:03:03,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 158 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:03,229 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 330 flow [2023-11-26 12:03:03,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2023-11-26 12:03:03,231 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -11 predicate places. [2023-11-26 12:03:03,231 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 330 flow [2023-11-26 12:03:03,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:03,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:03,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:03,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:03:03,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:03,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 801459983, now seen corresponding path program 1 times [2023-11-26 12:03:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184918618] [2023-11-26 12:03:03,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:03,315 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 12:03:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184918618] [2023-11-26 12:03:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184918618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:03,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:03,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019184191] [2023-11-26 12:03:03,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:03,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:03,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:03,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:03,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:03,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 200 [2023-11-26 12:03:03,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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 12:03:03,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:03,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 200 [2023-11-26 12:03:03,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:03,643 INFO L124 PetriNetUnfolderBase]: 347/1387 cut-off events. [2023-11-26 12:03:03,643 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-11-26 12:03:03,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 1387 events. 347/1387 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9781 event pairs, 117 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 2028. Up to 382 conditions per place. [2023-11-26 12:03:03,663 INFO L140 encePairwiseOnDemand]: 189/200 looper letters, 25 selfloop transitions, 8 changer transitions 0/172 dead transitions. [2023-11-26 12:03:03,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 172 transitions, 432 flow [2023-11-26 12:03:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2023-11-26 12:03:03,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.895 [2023-11-26 12:03:03,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2023-11-26 12:03:03,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2023-11-26 12:03:03,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:03,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2023-11-26 12:03:03,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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 12:03:03,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:03,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:03,671 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 330 flow. Second operand 3 states and 537 transitions. [2023-11-26 12:03:03,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 172 transitions, 432 flow [2023-11-26 12:03:03,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 172 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:03,676 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 399 flow [2023-11-26 12:03:03,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2023-11-26 12:03:03,678 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -8 predicate places. [2023-11-26 12:03:03,678 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 399 flow [2023-11-26 12:03:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 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 12:03:03,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:03,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:03:03,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:03,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 244468357, now seen corresponding path program 1 times [2023-11-26 12:03:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850935016] [2023-11-26 12:03:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:03,786 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 12:03:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850935016] [2023-11-26 12:03:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850935016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871605522] [2023-11-26 12:03:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:03,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:03,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 200 [2023-11-26 12:03:03,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 12:03:03,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:03,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 200 [2023-11-26 12:03:03,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:04,266 INFO L124 PetriNetUnfolderBase]: 447/1937 cut-off events. [2023-11-26 12:03:04,267 INFO L125 PetriNetUnfolderBase]: For 623/643 co-relation queries the response was YES. [2023-11-26 12:03:04,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1937 events. 447/1937 cut-off events. For 623/643 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15564 event pairs, 158 based on Foata normal form. 2/1727 useless extension candidates. Maximal degree in co-relation 3333. Up to 585 conditions per place. [2023-11-26 12:03:04,297 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 23 selfloop transitions, 10 changer transitions 0/177 dead transitions. [2023-11-26 12:03:04,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 177 transitions, 510 flow [2023-11-26 12:03:04,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2023-11-26 12:03:04,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8983333333333333 [2023-11-26 12:03:04,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2023-11-26 12:03:04,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2023-11-26 12:03:04,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:04,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2023-11-26 12:03:04,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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 12:03:04,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:04,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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 12:03:04,305 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 399 flow. Second operand 3 states and 539 transitions. [2023-11-26 12:03:04,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 177 transitions, 510 flow [2023-11-26 12:03:04,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 177 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:04,314 INFO L231 Difference]: Finished difference. Result has 169 places, 174 transitions, 469 flow [2023-11-26 12:03:04,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=169, PETRI_TRANSITIONS=174} [2023-11-26 12:03:04,317 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -6 predicate places. [2023-11-26 12:03:04,317 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 174 transitions, 469 flow [2023-11-26 12:03:04,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 12:03:04,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:04,318 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:04,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:03:04,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:04,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1876653039, now seen corresponding path program 1 times [2023-11-26 12:03:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283465324] [2023-11-26 12:03:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-26 12:03:04,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283465324] [2023-11-26 12:03:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283465324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378430212] [2023-11-26 12:03:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:04,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:04,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 200 [2023-11-26 12:03:04,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 174 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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 12:03:04,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:04,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 200 [2023-11-26 12:03:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:04,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread2of2ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of2ForFork0_#t~nondet6#1=|v_thr2Thread2of2ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of2ForFork0_#t~nondet6#1][158], [Black: 222#(= |#race~x~0| |thr2Thread1of2ForFork0_#t~nondet5#1|), 220#true, thr2Thread1of2ForFork0InUse, 99#L705-2true, thr2Thread2of2ForFork0InUse, thr1Thread1of2ForFork1InUse, 12#$Ultimate##0true, 131#L705-2true, 47#L714-4true, Black: 214#true, 226#true, 212#(= |#race~n~0| 0)]) [2023-11-26 12:03:04,784 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-26 12:03:04,784 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-26 12:03:04,784 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-26 12:03:04,784 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-26 12:03:04,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L702-4-->L705-2: Formula: (and (= |v_thr2Thread1of2ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of2ForFork0_#t~nondet6#1=|v_thr2Thread1of2ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of2ForFork0_#t~nondet6#1][128], [Black: 222#(= |#race~x~0| |thr2Thread1of2ForFork0_#t~nondet5#1|), 220#true, thr2Thread1of2ForFork0InUse, 99#L705-2true, thr2Thread2of2ForFork0InUse, thr1Thread1of2ForFork1InUse, 67#L-1-4true, 12#$Ultimate##0true, 131#L705-2true, Black: 214#true, 226#true, 212#(= |#race~n~0| 0)]) [2023-11-26 12:03:04,962 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-26 12:03:04,963 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-26 12:03:04,963 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 12:03:04,963 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 12:03:05,014 INFO L124 PetriNetUnfolderBase]: 540/2968 cut-off events. [2023-11-26 12:03:05,014 INFO L125 PetriNetUnfolderBase]: For 529/737 co-relation queries the response was YES. [2023-11-26 12:03:05,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4755 conditions, 2968 events. 540/2968 cut-off events. For 529/737 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27794 event pairs, 215 based on Foata normal form. 1/2606 useless extension candidates. Maximal degree in co-relation 4712. Up to 443 conditions per place. [2023-11-26 12:03:05,047 INFO L140 encePairwiseOnDemand]: 196/200 looper letters, 19 selfloop transitions, 0 changer transitions 4/177 dead transitions. [2023-11-26 12:03:05,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 177 transitions, 521 flow [2023-11-26 12:03:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:03:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:03:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2023-11-26 12:03:05,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.864 [2023-11-26 12:03:05,051 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2023-11-26 12:03:05,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2023-11-26 12:03:05,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:05,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2023-11-26 12:03:05,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:05,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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 12:03:05,058 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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 12:03:05,058 INFO L175 Difference]: Start difference. First operand has 169 places, 174 transitions, 469 flow. Second operand 5 states and 864 transitions. [2023-11-26 12:03:05,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 177 transitions, 521 flow [2023-11-26 12:03:05,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 177 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:05,066 INFO L231 Difference]: Finished difference. Result has 174 places, 173 transitions, 453 flow [2023-11-26 12:03:05,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=174, PETRI_TRANSITIONS=173} [2023-11-26 12:03:05,067 INFO L281 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2023-11-26 12:03:05,067 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 173 transitions, 453 flow [2023-11-26 12:03:05,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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 12:03:05,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:05,068 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:05,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 12:03:05,069 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-26 12:03:05,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1719966117, now seen corresponding path program 1 times [2023-11-26 12:03:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666875543] [2023-11-26 12:03:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:05,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:05,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:05,134 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:03:05,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-11-26 12:03:05,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-26 12:03:05,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-26 12:03:05,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-26 12:03:05,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-26 12:03:05,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-26 12:03:05,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-26 12:03:05,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-26 12:03:05,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-26 12:03:05,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-26 12:03:05,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-26 12:03:05,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2023-11-26 12:03:05,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-26 12:03:05,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-26 12:03:05,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-26 12:03:05,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-26 12:03:05,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-26 12:03:05,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-26 12:03:05,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-26 12:03:05,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-26 12:03:05,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-26 12:03:05,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-26 12:03:05,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 12:03:05,138 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:05,139 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 12:03:05,139 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 12:03:05,195 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:03:05,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 257 transitions, 550 flow [2023-11-26 12:03:05,238 INFO L124 PetriNetUnfolderBase]: 14/277 cut-off events. [2023-11-26 12:03:05,238 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 12:03:05,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 277 events. 14/277 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 629 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 288. Up to 8 conditions per place. [2023-11-26 12:03:05,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 257 transitions, 550 flow [2023-11-26 12:03:05,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 210 transitions, 441 flow [2023-11-26 12:03:05,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:03:05,251 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;@4f889a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:03:05,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-26 12:03:05,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:03:05,255 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 12:03:05,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:03:05,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:05,255 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] [2023-11-26 12:03:05,256 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:05,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2022129433, now seen corresponding path program 1 times [2023-11-26 12:03:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773631084] [2023-11-26 12:03:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:05,314 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 12:03:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773631084] [2023-11-26 12:03:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773631084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320025768] [2023-11-26 12:03:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:05,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:05,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 257 [2023-11-26 12:03:05,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 210 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 12:03:05,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:05,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 257 [2023-11-26 12:03:05,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:06,561 INFO L124 PetriNetUnfolderBase]: 1589/4926 cut-off events. [2023-11-26 12:03:06,562 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-26 12:03:06,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7236 conditions, 4926 events. 1589/4926 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 45466 event pairs, 1439 based on Foata normal form. 1274/5494 useless extension candidates. Maximal degree in co-relation 7166. Up to 2067 conditions per place. [2023-11-26 12:03:06,633 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 21 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2023-11-26 12:03:06,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 199 transitions, 465 flow [2023-11-26 12:03:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2023-11-26 12:03:06,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8767833981841764 [2023-11-26 12:03:06,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2023-11-26 12:03:06,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2023-11-26 12:03:06,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:06,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2023-11-26 12:03:06,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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 12:03:06,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:06,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:06,643 INFO L175 Difference]: Start difference. First operand has 209 places, 210 transitions, 441 flow. Second operand 3 states and 676 transitions. [2023-11-26 12:03:06,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 199 transitions, 465 flow [2023-11-26 12:03:06,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 199 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:06,649 INFO L231 Difference]: Finished difference. Result has 206 places, 198 transitions, 418 flow [2023-11-26 12:03:06,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=206, PETRI_TRANSITIONS=198} [2023-11-26 12:03:06,651 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -3 predicate places. [2023-11-26 12:03:06,651 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 198 transitions, 418 flow [2023-11-26 12:03:06,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 12:03:06,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:06,652 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] [2023-11-26 12:03:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 12:03:06,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:06,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash -234449179, now seen corresponding path program 1 times [2023-11-26 12:03:06,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69514662] [2023-11-26 12:03:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 12:03:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:06,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69514662] [2023-11-26 12:03:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69514662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:06,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:06,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013817682] [2023-11-26 12:03:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:06,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:06,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:06,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:06,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:06,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 257 [2023-11-26 12:03:06,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 198 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 12:03:06,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:06,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 257 [2023-11-26 12:03:06,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:08,236 INFO L124 PetriNetUnfolderBase]: 1176/6922 cut-off events. [2023-11-26 12:03:08,236 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-11-26 12:03:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8727 conditions, 6922 events. 1176/6922 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 75088 event pairs, 1154 based on Foata normal form. 0/5922 useless extension candidates. Maximal degree in co-relation 8692. Up to 1670 conditions per place. [2023-11-26 12:03:08,334 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 21 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-11-26 12:03:08,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 197 transitions, 462 flow [2023-11-26 12:03:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2023-11-26 12:03:08,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.867704280155642 [2023-11-26 12:03:08,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 669 transitions. [2023-11-26 12:03:08,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 669 transitions. [2023-11-26 12:03:08,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:08,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 669 transitions. [2023-11-26 12:03:08,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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 12:03:08,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:08,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:08,346 INFO L175 Difference]: Start difference. First operand has 206 places, 198 transitions, 418 flow. Second operand 3 states and 669 transitions. [2023-11-26 12:03:08,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 197 transitions, 462 flow [2023-11-26 12:03:08,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 197 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:08,355 INFO L231 Difference]: Finished difference. Result has 204 places, 197 transitions, 416 flow [2023-11-26 12:03:08,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=204, PETRI_TRANSITIONS=197} [2023-11-26 12:03:08,356 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -5 predicate places. [2023-11-26 12:03:08,357 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 197 transitions, 416 flow [2023-11-26 12:03:08,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 12:03:08,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:08,358 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 12:03:08,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 12:03:08,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:08,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash -827584762, now seen corresponding path program 1 times [2023-11-26 12:03:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103164639] [2023-11-26 12:03:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:08,394 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 12:03:08,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:08,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103164639] [2023-11-26 12:03:08,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103164639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:08,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:08,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:08,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818890017] [2023-11-26 12:03:08,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:08,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:08,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:08,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 257 [2023-11-26 12:03:08,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 197 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 12:03:08,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:08,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 257 [2023-11-26 12:03:08,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:11,076 INFO L124 PetriNetUnfolderBase]: 4181/13366 cut-off events. [2023-11-26 12:03:11,076 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2023-11-26 12:03:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18719 conditions, 13366 events. 4181/13366 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 146237 event pairs, 3658 based on Foata normal form. 0/11639 useless extension candidates. Maximal degree in co-relation 18677. Up to 5066 conditions per place. [2023-11-26 12:03:11,265 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 24 selfloop transitions, 1 changer transitions 0/190 dead transitions. [2023-11-26 12:03:11,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 190 transitions, 452 flow [2023-11-26 12:03:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-11-26 12:03:11,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8313878080415046 [2023-11-26 12:03:11,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-11-26 12:03:11,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-11-26 12:03:11,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:11,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-11-26 12:03:11,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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 12:03:11,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:11,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:11,275 INFO L175 Difference]: Start difference. First operand has 204 places, 197 transitions, 416 flow. Second operand 3 states and 641 transitions. [2023-11-26 12:03:11,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 190 transitions, 452 flow [2023-11-26 12:03:11,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:11,283 INFO L231 Difference]: Finished difference. Result has 197 places, 190 transitions, 400 flow [2023-11-26 12:03:11,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=197, PETRI_TRANSITIONS=190} [2023-11-26 12:03:11,284 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -12 predicate places. [2023-11-26 12:03:11,285 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 190 transitions, 400 flow [2023-11-26 12:03:11,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 12:03:11,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:11,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:11,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 12:03:11,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:11,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash -911197425, now seen corresponding path program 1 times [2023-11-26 12:03:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:11,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377840310] [2023-11-26 12:03:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:11,470 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 12:03:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377840310] [2023-11-26 12:03:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377840310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:11,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:11,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122208074] [2023-11-26 12:03:11,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:11,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:11,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:11,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:11,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:11,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 257 [2023-11-26 12:03:11,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 190 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:11,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:11,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 257 [2023-11-26 12:03:11,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:13,783 INFO L124 PetriNetUnfolderBase]: 4747/11775 cut-off events. [2023-11-26 12:03:13,783 INFO L125 PetriNetUnfolderBase]: For 735/735 co-relation queries the response was YES. [2023-11-26 12:03:13,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19332 conditions, 11775 events. 4747/11775 cut-off events. For 735/735 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 117339 event pairs, 1694 based on Foata normal form. 0/10133 useless extension candidates. Maximal degree in co-relation 19290. Up to 4100 conditions per place. [2023-11-26 12:03:13,979 INFO L140 encePairwiseOnDemand]: 242/257 looper letters, 35 selfloop transitions, 11 changer transitions 0/210 dead transitions. [2023-11-26 12:03:13,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 210 transitions, 545 flow [2023-11-26 12:03:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2023-11-26 12:03:13,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8780804150453956 [2023-11-26 12:03:13,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 677 transitions. [2023-11-26 12:03:13,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 677 transitions. [2023-11-26 12:03:13,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:13,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 677 transitions. [2023-11-26 12:03:13,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 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 12:03:13,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:13,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:13,991 INFO L175 Difference]: Start difference. First operand has 197 places, 190 transitions, 400 flow. Second operand 3 states and 677 transitions. [2023-11-26 12:03:13,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 210 transitions, 545 flow [2023-11-26 12:03:13,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 210 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:03:14,000 INFO L231 Difference]: Finished difference. Result has 200 places, 201 transitions, 495 flow [2023-11-26 12:03:14,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2023-11-26 12:03:14,002 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -9 predicate places. [2023-11-26 12:03:14,002 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 495 flow [2023-11-26 12:03:14,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 12:03:14,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:14,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:14,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 12:03:14,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:14,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1357588598, now seen corresponding path program 1 times [2023-11-26 12:03:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237466452] [2023-11-26 12:03:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:14,062 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 12:03:14,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:14,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237466452] [2023-11-26 12:03:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237466452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:14,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:14,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 12:03:14,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99864180] [2023-11-26 12:03:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:14,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:14,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:14,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:14,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 257 [2023-11-26 12:03:14,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 201 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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 12:03:14,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:14,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 257 [2023-11-26 12:03:14,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:16,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][125], [269#(= |#race~n~0| 0), 105#L700-3true, 273#(= |#race~x~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:16,012 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-26 12:03:16,012 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 12:03:16,012 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:16,012 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 12:03:16,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [269#(= |#race~n~0| 0), 105#L700-3true, 273#(= |#race~x~0| 0), 119#L694-2true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:16,039 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-26 12:03:16,039 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 12:03:16,039 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 12:03:16,039 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 12:03:16,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][216], [269#(= |#race~n~0| 0), 105#L700-3true, 273#(= |#race~x~0| 0), 57#L705-2true, 214#L694-1true, Black: 271#true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr1Thread1of3ForFork1InUse, 204#L703-4true]) [2023-11-26 12:03:16,509 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 12:03:16,509 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:16,509 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:16,509 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:17,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][207], [269#(= |#race~n~0| 0), 273#(= |#race~x~0| 0), 119#L694-2true, 57#L705-2true, Black: 271#true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr1Thread1of3ForFork1InUse, 204#L703-4true, 23#L705-2true]) [2023-11-26 12:03:17,412 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 12:03:17,412 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 12:03:17,412 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 12:03:17,412 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-26 12:03:17,518 INFO L124 PetriNetUnfolderBase]: 6562/18051 cut-off events. [2023-11-26 12:03:17,518 INFO L125 PetriNetUnfolderBase]: For 7614/8165 co-relation queries the response was YES. [2023-11-26 12:03:17,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35083 conditions, 18051 events. 6562/18051 cut-off events. For 7614/8165 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 202687 event pairs, 2467 based on Foata normal form. 44/15761 useless extension candidates. Maximal degree in co-relation 35040. Up to 7179 conditions per place. [2023-11-26 12:03:17,849 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 33 selfloop transitions, 14 changer transitions 0/219 dead transitions. [2023-11-26 12:03:17,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 219 transitions, 665 flow [2023-11-26 12:03:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 687 transitions. [2023-11-26 12:03:17,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8910505836575876 [2023-11-26 12:03:17,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 687 transitions. [2023-11-26 12:03:17,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 687 transitions. [2023-11-26 12:03:17,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:17,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 687 transitions. [2023-11-26 12:03:17,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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 12:03:17,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:17,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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 12:03:17,859 INFO L175 Difference]: Start difference. First operand has 200 places, 201 transitions, 495 flow. Second operand 3 states and 687 transitions. [2023-11-26 12:03:17,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 219 transitions, 665 flow [2023-11-26 12:03:17,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 219 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:17,888 INFO L231 Difference]: Finished difference. Result has 202 places, 213 transitions, 599 flow [2023-11-26 12:03:17,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=599, PETRI_PLACES=202, PETRI_TRANSITIONS=213} [2023-11-26 12:03:17,890 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -7 predicate places. [2023-11-26 12:03:17,890 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 213 transitions, 599 flow [2023-11-26 12:03:17,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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 12:03:17,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:17,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:17,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 12:03:17,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:17,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:17,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1841739132, now seen corresponding path program 1 times [2023-11-26 12:03:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:17,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61634222] [2023-11-26 12:03:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:17,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:17,999 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 12:03:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61634222] [2023-11-26 12:03:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61634222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:18,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:18,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289203092] [2023-11-26 12:03:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:18,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:18,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:18,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:18,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 257 [2023-11-26 12:03:18,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 213 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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 12:03:18,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:18,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 257 [2023-11-26 12:03:18,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:19,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:19,702 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-26 12:03:19,702 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 12:03:19,703 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 12:03:19,703 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 12:03:20,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 55#L701-1true]) [2023-11-26 12:03:20,111 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,111 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,111 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:20,111 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:20,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 57#L705-2true, 214#L694-1true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,182 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,182 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:20,182 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 12:03:20,182 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 43#L701-2true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,222 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,222 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 12:03:20,222 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 12:03:20,222 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 119#L694-2true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,261 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,262 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 12:03:20,262 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-26 12:03:20,262 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([831] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][203], [283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 57#L705-2true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 204#L703-4true, 55#L701-1true]) [2023-11-26 12:03:20,516 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,516 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,516 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,516 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,630 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-26 12:03:20,630 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 12:03:20,630 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 12:03:20,630 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-26 12:03:20,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:20,741 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,741 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,741 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,741 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 104#L701-1true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:20,743 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 12:03:20,743 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,743 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,744 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 55#L701-1true]) [2023-11-26 12:03:20,746 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 12:03:20,746 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,746 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,747 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 57#L705-2true, 214#L694-1true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,819 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-26 12:03:20,819 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,819 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,819 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 12:03:20,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 49#$Ultimate##0true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:20,843 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-26 12:03:20,843 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-26 12:03:20,843 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 12:03:20,843 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 12:03:20,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, 123#L701-2true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:20,845 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,845 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,845 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,845 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 43#L701-2true, 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,847 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,847 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,847 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,847 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 119#L694-2true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:20,904 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-26 12:03:20,904 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,904 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:20,904 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 12:03:21,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:21,214 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2023-11-26 12:03:21,214 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2023-11-26 12:03:21,214 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2023-11-26 12:03:21,215 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2023-11-26 12:03:21,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:21,217 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-26 12:03:21,217 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-26 12:03:21,217 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-26 12:03:21,217 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-26 12:03:21,388 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:21,389 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-26 12:03:21,389 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 12:03:21,389 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 12:03:21,389 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 12:03:21,389 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-26 12:03:21,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 214#L694-1true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:21,751 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-26 12:03:21,751 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-26 12:03:21,751 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-26 12:03:21,751 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-26 12:03:21,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 57#L705-2true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, 28#L714-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:21,793 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-26 12:03:21,794 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 12:03:21,794 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 12:03:21,794 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 12:03:22,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 223#L700-3true, 23#L705-2true]) [2023-11-26 12:03:22,126 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-26 12:03:22,126 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 12:03:22,126 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 12:03:22,126 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-26 12:03:22,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][212], [283#true, 104#L701-1true, 269#(= |#race~n~0| 0), 119#L694-2true, 40#L-1-4true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 204#L703-4true, 23#L705-2true]) [2023-11-26 12:03:22,188 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,188 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,188 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,188 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 215#L700-3true, 214#L694-1true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,216 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,216 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,216 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,216 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 117#L701-1true, 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,256 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,256 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,256 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,256 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 215#L700-3true, 119#L694-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,263 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,263 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,263 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,263 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,302 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,302 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,303 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,303 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([864] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][182], [104#L701-1true, 283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 40#L-1-4true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, 138#L702-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,304 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-26 12:03:22,304 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 12:03:22,305 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-26 12:03:22,305 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-26 12:03:22,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [201#L701-2true, 283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,314 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,315 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,315 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,315 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 57#L705-2true, 214#L694-1true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:22,343 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,343 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,343 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,343 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-26 12:03:22,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 105#L700-3true, 119#L694-2true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:22,370 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,371 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,371 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 12:03:22,371 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,430 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-26 12:03:22,430 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 12:03:22,430 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 12:03:22,430 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 12:03:22,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 239#L703-3true, 203#$Ultimate##0true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,447 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,448 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,448 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 12:03:22,448 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 12:03:22,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 214#L694-1true, 57#L705-2true, 40#L-1-4true, Black: 271#true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 277#true, thr2Thread3of3ForFork0InUse, 230#L703-3true, thr1Thread1of3ForFork1InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 23#L705-2true]) [2023-11-26 12:03:22,487 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-26 12:03:22,487 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,487 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-26 12:03:22,487 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-26 12:03:22,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:22,493 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,493 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,493 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-26 12:03:22,494 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 119#L694-2true, 57#L705-2true, 40#L-1-4true, Black: 271#true, thr2Thread1of3ForFork0InUse, Black: 277#true, thr2Thread2of3ForFork0InUse, thr2Thread3of3ForFork0InUse, 230#L703-3true, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,514 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,514 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,514 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,515 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, Black: 271#true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 277#true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, 230#L703-3true, thr1Thread1of3ForFork1InUse, 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 23#L705-2true]) [2023-11-26 12:03:22,530 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,530 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,530 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,531 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), 195#L705-2true, thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,538 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,538 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,538 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,538 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([874] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread3of3ForFork0_#t~nondet6#1=|v_thr2Thread3of3ForFork0_#t~nondet6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~nondet6#1][190], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:22,562 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,562 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,562 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,562 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~nondet6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~nondet6#1=|v_thr2Thread1of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~nondet6#1][128], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, 195#L705-2true, thr2Thread1of3ForFork0InUse, 165#L703-3true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse]) [2023-11-26 12:03:22,591 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,591 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-26 12:03:22,591 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,591 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 12:03:22,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 57#L705-2true, 40#L-1-4true, 277#true, Black: 271#true, thr2Thread1of3ForFork0InUse, 138#L702-4true, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,591 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-26 12:03:22,591 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-26 12:03:22,844 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,844 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-26 12:03:22,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, 230#L703-3true, thr1Thread1of3ForFork1InUse, 23#L705-2true]) [2023-11-26 12:03:22,853 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-26 12:03:22,854 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-26 12:03:22,854 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,854 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-26 12:03:22,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~nondet6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~nondet6#1=|v_thr2Thread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~nondet6#1][166], [283#true, 269#(= |#race~n~0| 0), 203#$Ultimate##0true, 57#L705-2true, 40#L-1-4true, 277#true, Black: 273#(= |#race~x~0| 0), thr2Thread1of3ForFork0InUse, thr2Thread2of3ForFork0InUse, Black: 279#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), thr2Thread3of3ForFork0InUse, thr1Thread1of3ForFork1InUse, 204#L703-4true, 23#L705-2true]) [2023-11-26 12:03:22,870 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is cut-off event [2023-11-26 12:03:22,870 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 12:03:22,871 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2023-11-26 12:03:22,871 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-26 12:03:22,904 INFO L124 PetriNetUnfolderBase]: 7418/26205 cut-off events. [2023-11-26 12:03:22,905 INFO L125 PetriNetUnfolderBase]: For 6145/10716 co-relation queries the response was YES. [2023-11-26 12:03:23,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45332 conditions, 26205 events. 7418/26205 cut-off events. For 6145/10716 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 341632 event pairs, 2943 based on Foata normal form. 7/22226 useless extension candidates. Maximal degree in co-relation 45288. Up to 4820 conditions per place. [2023-11-26 12:03:23,220 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 22 selfloop transitions, 0 changer transitions 4/216 dead transitions. [2023-11-26 12:03:23,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 216 transitions, 657 flow [2023-11-26 12:03:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:03:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:03:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-11-26 12:03:23,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8653696498054475 [2023-11-26 12:03:23,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-11-26 12:03:23,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-11-26 12:03:23,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:23,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-11-26 12:03:23,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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 12:03:23,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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 12:03:23,234 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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 12:03:23,234 INFO L175 Difference]: Start difference. First operand has 202 places, 213 transitions, 599 flow. Second operand 5 states and 1112 transitions. [2023-11-26 12:03:23,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 216 transitions, 657 flow [2023-11-26 12:03:23,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 216 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:23,327 INFO L231 Difference]: Finished difference. Result has 207 places, 212 transitions, 575 flow [2023-11-26 12:03:23,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=575, PETRI_PLACES=207, PETRI_TRANSITIONS=212} [2023-11-26 12:03:23,328 INFO L281 CegarLoopForPetriNet]: 209 programPoint places, -2 predicate places. [2023-11-26 12:03:23,328 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 212 transitions, 575 flow [2023-11-26 12:03:23,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 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 12:03:23,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:23,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:23,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 12:03:23,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2023-11-26 12:03:23,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 82237691, now seen corresponding path program 1 times [2023-11-26 12:03:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683469677] [2023-11-26 12:03:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:23,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 12:03:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 12:03:23,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 12:03:23,387 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 12:03:23,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2023-11-26 12:03:23,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2023-11-26 12:03:23,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2023-11-26 12:03:23,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2023-11-26 12:03:23,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2023-11-26 12:03:23,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2023-11-26 12:03:23,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2023-11-26 12:03:23,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2023-11-26 12:03:23,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2023-11-26 12:03:23,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2023-11-26 12:03:23,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2023-11-26 12:03:23,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2023-11-26 12:03:23,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2023-11-26 12:03:23,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2023-11-26 12:03:23,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2023-11-26 12:03:23,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2023-11-26 12:03:23,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2023-11-26 12:03:23,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2023-11-26 12:03:23,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2023-11-26 12:03:23,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2023-11-26 12:03:23,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2023-11-26 12:03:23,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2023-11-26 12:03:23,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2023-11-26 12:03:23,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2023-11-26 12:03:23,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2023-11-26 12:03:23,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2023-11-26 12:03:23,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2023-11-26 12:03:23,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 12:03:23,393 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:23,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-11-26 12:03:23,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 12:03:23,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 12:03:23,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-26 12:03:23,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 12:03:23,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-26 12:03:23,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 12:03:23,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 12:03:23,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:03:23 BasicIcfg [2023-11-26 12:03:23,543 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 12:03:23,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 12:03:23,544 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 12:03:23,544 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 12:03:23,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:02:59" (3/4) ... [2023-11-26 12:03:23,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 12:03:23,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 12:03:23,549 INFO L158 Benchmark]: Toolchain (without parser) took 25883.43ms. Allocated memory was 180.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 136.5MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 947.3MB. Max. memory is 16.1GB. [2023-11-26 12:03:23,549 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:23,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.37ms. Allocated memory is still 180.4MB. Free memory was 136.0MB in the beginning and 115.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-26 12:03:23,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.40ms. Allocated memory is still 180.4MB. Free memory was 115.6MB in the beginning and 113.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:23,550 INFO L158 Benchmark]: Boogie Preprocessor took 68.92ms. Allocated memory is still 180.4MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 12:03:23,550 INFO L158 Benchmark]: RCFGBuilder took 647.84ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 94.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 12:03:23,551 INFO L158 Benchmark]: TraceAbstraction took 24513.27ms. Allocated memory was 180.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 94.1MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 903.3MB. Max. memory is 16.1GB. [2023-11-26 12:03:23,551 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 8.8GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 12:03:23,557 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.37ms. Allocated memory is still 180.4MB. Free memory was 136.0MB in the beginning and 115.6MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.40ms. Allocated memory is still 180.4MB. Free memory was 115.6MB in the beginning and 113.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.92ms. Allocated memory is still 180.4MB. Free memory was 113.4MB in the beginning and 111.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.84ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 94.6MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24513.27ms. Allocated memory was 180.4MB in the beginning and 8.8GB in the end (delta: 8.6GB). Free memory was 94.1MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 903.3MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 8.8GB. Free memory is still 7.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected [2023-11-26 12:03:23,645 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-26 12:03:23,647 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 12:03:23,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,648 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,649 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 12:03:23,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-26 12:03:23,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 12:03:23,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-26 12:03:23,718 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-26 12:03:23,719 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet8 could not be translated [2023-11-26 12:03:23,719 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,720 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,720 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-26 12:03:23,723 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 12:03:23,724 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-26 12:03:23,724 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-26 12:03:23,725 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=0, t1={6:0}, t2={5:0}, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n <= 10 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=10, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, argc=52, argv={50:53}, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L713] 0 i < n VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, argc=52, argv={50:53}, i=0, mut={3:0}, n=10, t1={6:0}, t2={5:0}, x=0] [L697] 2 int t; VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=10, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] 2 k == n VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] COND TRUE 2 k == n VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L703] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=1] [L694] 1 x < n VAL [arg={0:0}, arg={0:0}, mut={3:0}, n=10, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x < n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 191 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 39 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=291occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 244 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.6s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 284 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 95 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 26/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 297 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 93 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-26 12:03:23,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd351a89-ffb7-44a8-b9ff-94316bebb8d7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE