./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/sssc12.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f04269da33313e0538e960083eba1e7b90d9e89847d2a89d06392d6991a3ed98 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:46:21,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:46:21,307 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 04:46:21,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:46:21,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:46:21,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:46:21,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:46:21,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:46:21,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:46:21,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:46:21,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:46:21,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:46:21,345 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:46:21,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:46:21,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:46:21,346 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:46:21,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:46:21,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:46:21,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:46:21,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:46:21,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:46:21,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:46:21,350 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 04:46:21,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:46:21,351 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:46:21,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:46:21,352 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:46:21,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:46:21,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:46:21,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:46:21,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:46:21,354 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:46:21,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:46:21,355 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:46:21,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:46:21,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:46:21,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:46:21,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:46:21,356 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:46:21,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:46:21,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:46:21,357 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_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f04269da33313e0538e960083eba1e7b90d9e89847d2a89d06392d6991a3ed98 [2023-11-29 04:46:21,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:46:21,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:46:21,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:46:21,597 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:46:21,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:46:21,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-lit/sssc12.i [2023-11-29 04:46:24,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:46:24,537 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:46:24,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/sv-benchmarks/c/pthread-lit/sssc12.i [2023-11-29 04:46:24,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/data/4f7471ae0/0f32e1e2a76e4c9caf7d008af2321eed/FLAGd0b4353cb [2023-11-29 04:46:24,568 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/data/4f7471ae0/0f32e1e2a76e4c9caf7d008af2321eed [2023-11-29 04:46:24,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:46:24,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:46:24,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:46:24,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:46:24,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:46:24,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:46:24" (1/1) ... [2023-11-29 04:46:24,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604db5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:24, skipping insertion in model container [2023-11-29 04:46:24,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:46:24" (1/1) ... [2023-11-29 04:46:24,630 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:46:24,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:46:24,994 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:46:25,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:46:25,093 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:46:25,093 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:46:25,101 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:46:25,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25 WrapperNode [2023-11-29 04:46:25,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:46:25,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:46:25,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:46:25,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:46:25,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,151 INFO L138 Inliner]: procedures = 275, calls = 24, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 150 [2023-11-29 04:46:25,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:46:25,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:46:25,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:46:25,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:46:25,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:46:25,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:46:25,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:46:25,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:46:25,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (1/1) ... [2023-11-29 04:46:25,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:46:25,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:46:25,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:46:25,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e38b1a33-5c3d-4bb6-8def-2ee9c6a83862/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:46:25,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 04:46:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-11-29 04:46:25,243 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-11-29 04:46:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:46:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:46:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 04:46:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 04:46:25,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:46:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:46:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 04:46:25,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:46:25,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:46:25,246 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:46:25,366 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:46:25,368 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:46:25,618 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:46:25,670 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:46:25,670 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 04:46:25,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:46:25 BoogieIcfgContainer [2023-11-29 04:46:25,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:46:25,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:46:25,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:46:25,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:46:25,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:46:24" (1/3) ... [2023-11-29 04:46:25,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a49c56a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:46:25, skipping insertion in model container [2023-11-29 04:46:25,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:46:25" (2/3) ... [2023-11-29 04:46:25,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a49c56a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:46:25, skipping insertion in model container [2023-11-29 04:46:25,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:46:25" (3/3) ... [2023-11-29 04:46:25,681 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12.i [2023-11-29 04:46:25,689 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 04:46:25,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:46:25,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-11-29 04:46:25,700 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:46:25,762 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:46:25,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 157 transitions, 318 flow [2023-11-29 04:46:25,858 INFO L124 PetriNetUnfolderBase]: 10/169 cut-off events. [2023-11-29 04:46:25,858 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:46:25,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 169 events. 10/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 186 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-29 04:46:25,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 157 transitions, 318 flow [2023-11-29 04:46:25,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 157 transitions, 318 flow [2023-11-29 04:46:25,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:46:25,888 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;@2392b8cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:46:25,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2023-11-29 04:46:25,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:46:25,893 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-29 04:46:25,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:46:25,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:25,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:25,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:25,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash -521632500, now seen corresponding path program 1 times [2023-11-29 04:46:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:25,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039970482] [2023-11-29 04:46:25,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:25,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039970482] [2023-11-29 04:46:26,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039970482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:26,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:26,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110652187] [2023-11-29 04:46:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:26,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:26,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:26,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:26,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 157 [2023-11-29 04:46:26,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 157 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:26,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 157 [2023-11-29 04:46:26,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:26,207 INFO L124 PetriNetUnfolderBase]: 4/141 cut-off events. [2023-11-29 04:46:26,207 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:46:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 141 events. 4/141 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 12/133 useless extension candidates. Maximal degree in co-relation 79. Up to 11 conditions per place. [2023-11-29 04:46:26,209 INFO L140 encePairwiseOnDemand]: 144/157 looper letters, 10 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2023-11-29 04:46:26,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 137 transitions, 302 flow [2023-11-29 04:46:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-11-29 04:46:26,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8895966029723992 [2023-11-29 04:46:26,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-11-29 04:46:26,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-11-29 04:46:26,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:26,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-11-29 04:46:26,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,243 INFO L175 Difference]: Start difference. First operand has 151 places, 157 transitions, 318 flow. Second operand 3 states and 419 transitions. [2023-11-29 04:46:26,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 137 transitions, 302 flow [2023-11-29 04:46:26,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 137 transitions, 302 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:46:26,252 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 280 flow [2023-11-29 04:46:26,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2023-11-29 04:46:26,258 INFO L281 CegarLoopForPetriNet]: 151 programPoint places, -13 predicate places. [2023-11-29 04:46:26,258 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 280 flow [2023-11-29 04:46:26,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:26,259 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] [2023-11-29 04:46:26,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:46:26,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:26,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1915409512, now seen corresponding path program 1 times [2023-11-29 04:46:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:26,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538791028] [2023-11-29 04:46:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:26,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538791028] [2023-11-29 04:46:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538791028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:26,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:26,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568856089] [2023-11-29 04:46:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:26,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:26,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:26,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 157 [2023-11-29 04:46:26,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 136 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:26,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 157 [2023-11-29 04:46:26,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:26,363 INFO L124 PetriNetUnfolderBase]: 4/139 cut-off events. [2023-11-29 04:46:26,363 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:46:26,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 139 events. 4/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 130. Up to 7 conditions per place. [2023-11-29 04:46:26,364 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 6 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2023-11-29 04:46:26,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 135 transitions, 294 flow [2023-11-29 04:46:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-11-29 04:46:26,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8853503184713376 [2023-11-29 04:46:26,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-11-29 04:46:26,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-11-29 04:46:26,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:26,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-11-29 04:46:26,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,374 INFO L175 Difference]: Start difference. First operand has 138 places, 136 transitions, 280 flow. Second operand 3 states and 417 transitions. [2023-11-29 04:46:26,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 135 transitions, 294 flow [2023-11-29 04:46:26,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:26,378 INFO L231 Difference]: Finished difference. Result has 136 places, 135 transitions, 278 flow [2023-11-29 04:46:26,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=136, PETRI_TRANSITIONS=135} [2023-11-29 04:46:26,379 INFO L281 CegarLoopForPetriNet]: 151 programPoint places, -15 predicate places. [2023-11-29 04:46:26,379 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 135 transitions, 278 flow [2023-11-29 04:46:26,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:26,380 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] [2023-11-29 04:46:26,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:46:26,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:26,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1863302128, now seen corresponding path program 1 times [2023-11-29 04:46:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:26,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075900373] [2023-11-29 04:46:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075900373] [2023-11-29 04:46:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075900373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82539042] [2023-11-29 04:46:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:26,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:26,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:26,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:26,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 157 [2023-11-29 04:46:26,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 135 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:26,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 157 [2023-11-29 04:46:26,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:26,508 INFO L124 PetriNetUnfolderBase]: 4/138 cut-off events. [2023-11-29 04:46:26,508 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:46:26,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 138 events. 4/138 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 129. Up to 12 conditions per place. [2023-11-29 04:46:26,510 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 11 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2023-11-29 04:46:26,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 134 transitions, 302 flow [2023-11-29 04:46:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-11-29 04:46:26,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8641188959660298 [2023-11-29 04:46:26,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-11-29 04:46:26,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-11-29 04:46:26,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:26,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-11-29 04:46:26,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,517 INFO L175 Difference]: Start difference. First operand has 136 places, 135 transitions, 278 flow. Second operand 3 states and 407 transitions. [2023-11-29 04:46:26,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 134 transitions, 302 flow [2023-11-29 04:46:26,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:26,521 INFO L231 Difference]: Finished difference. Result has 135 places, 134 transitions, 276 flow [2023-11-29 04:46:26,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=135, PETRI_TRANSITIONS=134} [2023-11-29 04:46:26,522 INFO L281 CegarLoopForPetriNet]: 151 programPoint places, -16 predicate places. [2023-11-29 04:46:26,522 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 134 transitions, 276 flow [2023-11-29 04:46:26,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:26,523 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] [2023-11-29 04:46:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:46:26,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:26,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1466447951, now seen corresponding path program 1 times [2023-11-29 04:46:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220125502] [2023-11-29 04:46:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:26,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220125502] [2023-11-29 04:46:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220125502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:26,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:26,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706784019] [2023-11-29 04:46:26,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:26,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:26,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 157 [2023-11-29 04:46:26,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:26,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 157 [2023-11-29 04:46:26,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:26,631 INFO L124 PetriNetUnfolderBase]: 4/133 cut-off events. [2023-11-29 04:46:26,631 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 04:46:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 133 events. 4/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 117. Up to 13 conditions per place. [2023-11-29 04:46:26,632 INFO L140 encePairwiseOnDemand]: 151/157 looper letters, 13 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2023-11-29 04:46:26,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 294 flow [2023-11-29 04:46:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-11-29 04:46:26,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8492569002123143 [2023-11-29 04:46:26,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-11-29 04:46:26,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-11-29 04:46:26,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:26,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-11-29 04:46:26,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,639 INFO L175 Difference]: Start difference. First operand has 135 places, 134 transitions, 276 flow. Second operand 3 states and 400 transitions. [2023-11-29 04:46:26,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 294 flow [2023-11-29 04:46:26,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:26,642 INFO L231 Difference]: Finished difference. Result has 130 places, 129 transitions, 264 flow [2023-11-29 04:46:26,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=130, PETRI_TRANSITIONS=129} [2023-11-29 04:46:26,643 INFO L281 CegarLoopForPetriNet]: 151 programPoint places, -21 predicate places. [2023-11-29 04:46:26,643 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 264 flow [2023-11-29 04:46:26,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:26,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:26,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:46:26,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:26,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 390959093, now seen corresponding path program 1 times [2023-11-29 04:46:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:26,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270425266] [2023-11-29 04:46:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:26,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:26,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270425266] [2023-11-29 04:46:26,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270425266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:26,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282803814] [2023-11-29 04:46:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:26,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 157 [2023-11-29 04:46:26,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 157 [2023-11-29 04:46:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:26,753 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-29 04:46:26,753 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:46:26,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 132 events. 4/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 8 conditions per place. [2023-11-29 04:46:26,754 INFO L140 encePairwiseOnDemand]: 154/157 looper letters, 7 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2023-11-29 04:46:26,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 128 transitions, 280 flow [2023-11-29 04:46:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-11-29 04:46:26,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.881104033970276 [2023-11-29 04:46:26,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-11-29 04:46:26,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-11-29 04:46:26,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:26,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-11-29 04:46:26,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,761 INFO L175 Difference]: Start difference. First operand has 130 places, 129 transitions, 264 flow. Second operand 3 states and 415 transitions. [2023-11-29 04:46:26,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 128 transitions, 280 flow [2023-11-29 04:46:26,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:46:26,764 INFO L231 Difference]: Finished difference. Result has 130 places, 128 transitions, 265 flow [2023-11-29 04:46:26,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=130, PETRI_TRANSITIONS=128} [2023-11-29 04:46:26,765 INFO L281 CegarLoopForPetriNet]: 151 programPoint places, -21 predicate places. [2023-11-29 04:46:26,765 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 128 transitions, 265 flow [2023-11-29 04:46:26,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:26,766 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:46:26,767 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:26,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1577439946, now seen corresponding path program 1 times [2023-11-29 04:46:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:26,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707018489] [2023-11-29 04:46:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 04:46:26,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:26,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707018489] [2023-11-29 04:46:26,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707018489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:26,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:26,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:46:26,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308988313] [2023-11-29 04:46:26,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:46:26,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:26,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:46:26,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:26,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 157 [2023-11-29 04:46:26,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 128 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:26,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 157 [2023-11-29 04:46:26,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:26,975 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-11-29 04:46:26,975 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-29 04:46:26,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 135 events. 3/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 1/125 useless extension candidates. Maximal degree in co-relation 124. Up to 15 conditions per place. [2023-11-29 04:46:26,976 INFO L140 encePairwiseOnDemand]: 153/157 looper letters, 14 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2023-11-29 04:46:26,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 307 flow [2023-11-29 04:46:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:46:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:46:26,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-11-29 04:46:26,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.845859872611465 [2023-11-29 04:46:26,979 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-11-29 04:46:26,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-11-29 04:46:26,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:26,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-11-29 04:46:26,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,984 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,984 INFO L175 Difference]: Start difference. First operand has 130 places, 128 transitions, 265 flow. Second operand 5 states and 664 transitions. [2023-11-29 04:46:26,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 307 flow [2023-11-29 04:46:26,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:26,987 INFO L231 Difference]: Finished difference. Result has 135 places, 127 transitions, 265 flow [2023-11-29 04:46:26,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, 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=265, PETRI_PLACES=135, PETRI_TRANSITIONS=127} [2023-11-29 04:46:26,988 INFO L281 CegarLoopForPetriNet]: 151 programPoint places, -16 predicate places. [2023-11-29 04:46:26,988 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 127 transitions, 265 flow [2023-11-29 04:46:26,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:26,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:26,989 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:46:26,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-29 04:46:26,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1249980534, now seen corresponding path program 1 times [2023-11-29 04:46:26,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:26,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147380551] [2023-11-29 04:46:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:46:27,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:46:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:46:27,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:46:27,055 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:46:27,056 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 32 remaining) [2023-11-29 04:46:27,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 32 remaining) [2023-11-29 04:46:27,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (29 of 32 remaining) [2023-11-29 04:46:27,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (28 of 32 remaining) [2023-11-29 04:46:27,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 32 remaining) [2023-11-29 04:46:27,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 32 remaining) [2023-11-29 04:46:27,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 32 remaining) [2023-11-29 04:46:27,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (24 of 32 remaining) [2023-11-29 04:46:27,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 32 remaining) [2023-11-29 04:46:27,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 32 remaining) [2023-11-29 04:46:27,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 32 remaining) [2023-11-29 04:46:27,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 32 remaining) [2023-11-29 04:46:27,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 32 remaining) [2023-11-29 04:46:27,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 32 remaining) [2023-11-29 04:46:27,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 32 remaining) [2023-11-29 04:46:27,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 32 remaining) [2023-11-29 04:46:27,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 32 remaining) [2023-11-29 04:46:27,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 32 remaining) [2023-11-29 04:46:27,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 32 remaining) [2023-11-29 04:46:27,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 32 remaining) [2023-11-29 04:46:27,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 32 remaining) [2023-11-29 04:46:27,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 32 remaining) [2023-11-29 04:46:27,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 32 remaining) [2023-11-29 04:46:27,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 32 remaining) [2023-11-29 04:46:27,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 32 remaining) [2023-11-29 04:46:27,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 32 remaining) [2023-11-29 04:46:27,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 32 remaining) [2023-11-29 04:46:27,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 32 remaining) [2023-11-29 04:46:27,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 32 remaining) [2023-11-29 04:46:27,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 32 remaining) [2023-11-29 04:46:27,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 32 remaining) [2023-11-29 04:46:27,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 32 remaining) [2023-11-29 04:46:27,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:46:27,064 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:27,067 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 04:46:27,067 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-29 04:46:27,111 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:46:27,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 235 transitions, 480 flow [2023-11-29 04:46:27,166 INFO L124 PetriNetUnfolderBase]: 17/261 cut-off events. [2023-11-29 04:46:27,166 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 04:46:27,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 261 events. 17/261 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 598 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 170. Up to 6 conditions per place. [2023-11-29 04:46:27,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 235 transitions, 480 flow [2023-11-29 04:46:27,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 235 transitions, 480 flow [2023-11-29 04:46:27,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:46:27,174 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;@2392b8cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:46:27,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2023-11-29 04:46:27,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:46:27,177 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-29 04:46:27,177 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:46:27,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:27,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:27,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:27,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1689557751, now seen corresponding path program 1 times [2023-11-29 04:46:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406139087] [2023-11-29 04:46:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:27,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:27,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406139087] [2023-11-29 04:46:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406139087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:27,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140838391] [2023-11-29 04:46:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:27,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:27,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 235 [2023-11-29 04:46:27,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 235 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:27,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 235 [2023-11-29 04:46:27,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:27,332 INFO L124 PetriNetUnfolderBase]: 70/684 cut-off events. [2023-11-29 04:46:27,332 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-29 04:46:27,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 684 events. 70/684 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3855 event pairs, 42 based on Foata normal form. 99/667 useless extension candidates. Maximal degree in co-relation 626. Up to 102 conditions per place. [2023-11-29 04:46:27,339 INFO L140 encePairwiseOnDemand]: 215/235 looper letters, 17 selfloop transitions, 2 changer transitions 1/205 dead transitions. [2023-11-29 04:46:27,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 205 transitions, 458 flow [2023-11-29 04:46:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2023-11-29 04:46:27,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8822695035460993 [2023-11-29 04:46:27,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2023-11-29 04:46:27,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2023-11-29 04:46:27,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:27,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2023-11-29 04:46:27,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,346 INFO L175 Difference]: Start difference. First operand has 225 places, 235 transitions, 480 flow. Second operand 3 states and 622 transitions. [2023-11-29 04:46:27,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 205 transitions, 458 flow [2023-11-29 04:46:27,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 205 transitions, 458 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 04:46:27,349 INFO L231 Difference]: Finished difference. Result has 205 places, 204 transitions, 422 flow [2023-11-29 04:46:27,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=205, PETRI_TRANSITIONS=204} [2023-11-29 04:46:27,350 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places. [2023-11-29 04:46:27,351 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 204 transitions, 422 flow [2023-11-29 04:46:27,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:27,351 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] [2023-11-29 04:46:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:46:27,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:27,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -38861128, now seen corresponding path program 1 times [2023-11-29 04:46:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454474225] [2023-11-29 04:46:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:27,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454474225] [2023-11-29 04:46:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454474225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113066949] [2023-11-29 04:46:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:27,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:27,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2023-11-29 04:46:27,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 204 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:27,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2023-11-29 04:46:27,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:27,451 INFO L124 PetriNetUnfolderBase]: 22/402 cut-off events. [2023-11-29 04:46:27,451 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 04:46:27,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 402 events. 22/402 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1571 event pairs, 6 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 417. Up to 22 conditions per place. [2023-11-29 04:46:27,455 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 9 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2023-11-29 04:46:27,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 203 transitions, 442 flow [2023-11-29 04:46:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2023-11-29 04:46:27,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8808510638297873 [2023-11-29 04:46:27,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 621 transitions. [2023-11-29 04:46:27,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 621 transitions. [2023-11-29 04:46:27,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:27,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 621 transitions. [2023-11-29 04:46:27,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,461 INFO L175 Difference]: Start difference. First operand has 205 places, 204 transitions, 422 flow. Second operand 3 states and 621 transitions. [2023-11-29 04:46:27,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 203 transitions, 442 flow [2023-11-29 04:46:27,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:27,465 INFO L231 Difference]: Finished difference. Result has 203 places, 203 transitions, 420 flow [2023-11-29 04:46:27,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=203, PETRI_TRANSITIONS=203} [2023-11-29 04:46:27,466 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -22 predicate places. [2023-11-29 04:46:27,467 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 203 transitions, 420 flow [2023-11-29 04:46:27,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:27,467 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] [2023-11-29 04:46:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:46:27,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:27,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash -195538533, now seen corresponding path program 1 times [2023-11-29 04:46:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744123464] [2023-11-29 04:46:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744123464] [2023-11-29 04:46:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744123464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008781778] [2023-11-29 04:46:27,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:27,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235 [2023-11-29 04:46:27,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 203 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:27,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235 [2023-11-29 04:46:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:27,632 INFO L124 PetriNetUnfolderBase]: 42/537 cut-off events. [2023-11-29 04:46:27,632 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 04:46:27,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 537 events. 42/537 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2574 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 588. Up to 57 conditions per place. [2023-11-29 04:46:27,638 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 16 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2023-11-29 04:46:27,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 454 flow [2023-11-29 04:46:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2023-11-29 04:46:27,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8609929078014185 [2023-11-29 04:46:27,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 607 transitions. [2023-11-29 04:46:27,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 607 transitions. [2023-11-29 04:46:27,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:27,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 607 transitions. [2023-11-29 04:46:27,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 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-29 04:46:27,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,646 INFO L175 Difference]: Start difference. First operand has 203 places, 203 transitions, 420 flow. Second operand 3 states and 607 transitions. [2023-11-29 04:46:27,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 454 flow [2023-11-29 04:46:27,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 202 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:27,650 INFO L231 Difference]: Finished difference. Result has 202 places, 202 transitions, 418 flow [2023-11-29 04:46:27,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=202, PETRI_TRANSITIONS=202} [2023-11-29 04:46:27,651 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -23 predicate places. [2023-11-29 04:46:27,651 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 202 transitions, 418 flow [2023-11-29 04:46:27,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:27,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, 1, 1] [2023-11-29 04:46:27,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:46:27,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:27,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2023361892, now seen corresponding path program 1 times [2023-11-29 04:46:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018453773] [2023-11-29 04:46:27,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018453773] [2023-11-29 04:46:27,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018453773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592065666] [2023-11-29 04:46:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:27,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 235 [2023-11-29 04:46:27,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 202 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:27,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 235 [2023-11-29 04:46:27,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:27,825 INFO L124 PetriNetUnfolderBase]: 82/822 cut-off events. [2023-11-29 04:46:27,825 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-29 04:46:27,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 822 events. 82/822 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4816 event pairs, 42 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 923. Up to 109 conditions per place. [2023-11-29 04:46:27,833 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 20 selfloop transitions, 1 changer transitions 0/195 dead transitions. [2023-11-29 04:46:27,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 195 transitions, 446 flow [2023-11-29 04:46:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2023-11-29 04:46:27,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8397163120567376 [2023-11-29 04:46:27,835 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 592 transitions. [2023-11-29 04:46:27,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 592 transitions. [2023-11-29 04:46:27,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:27,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 592 transitions. [2023-11-29 04:46:27,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,839 INFO L175 Difference]: Start difference. First operand has 202 places, 202 transitions, 418 flow. Second operand 3 states and 592 transitions. [2023-11-29 04:46:27,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 195 transitions, 446 flow [2023-11-29 04:46:27,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 195 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:27,843 INFO L231 Difference]: Finished difference. Result has 195 places, 195 transitions, 402 flow [2023-11-29 04:46:27,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=195, PETRI_TRANSITIONS=195} [2023-11-29 04:46:27,844 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -30 predicate places. [2023-11-29 04:46:27,844 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 195 transitions, 402 flow [2023-11-29 04:46:27,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:27,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:27,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:46:27,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:27,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -61616160, now seen corresponding path program 1 times [2023-11-29 04:46:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586460565] [2023-11-29 04:46:27,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:27,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586460565] [2023-11-29 04:46:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586460565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:27,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431769840] [2023-11-29 04:46:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:27,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:27,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:27,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 235 [2023-11-29 04:46:27,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 195 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 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-29 04:46:27,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:27,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 235 [2023-11-29 04:46:27,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:27,952 INFO L124 PetriNetUnfolderBase]: 31/452 cut-off events. [2023-11-29 04:46:27,953 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 04:46:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 452 events. 31/452 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1853 event pairs, 12 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 470. Up to 36 conditions per place. [2023-11-29 04:46:27,957 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 11 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-11-29 04:46:27,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 194 transitions, 426 flow [2023-11-29 04:46:27,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2023-11-29 04:46:27,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.875177304964539 [2023-11-29 04:46:27,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 617 transitions. [2023-11-29 04:46:27,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 617 transitions. [2023-11-29 04:46:27,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:27,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 617 transitions. [2023-11-29 04:46:27,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:27,963 INFO L175 Difference]: Start difference. First operand has 195 places, 195 transitions, 402 flow. Second operand 3 states and 617 transitions. [2023-11-29 04:46:27,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 194 transitions, 426 flow [2023-11-29 04:46:27,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 194 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:46:27,966 INFO L231 Difference]: Finished difference. Result has 195 places, 194 transitions, 403 flow [2023-11-29 04:46:27,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=195, PETRI_TRANSITIONS=194} [2023-11-29 04:46:27,967 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -30 predicate places. [2023-11-29 04:46:27,967 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 194 transitions, 403 flow [2023-11-29 04:46:27,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 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-29 04:46:27,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:27,968 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] [2023-11-29 04:46:27,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:46:27,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:27,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:27,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1169524454, now seen corresponding path program 1 times [2023-11-29 04:46:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161119447] [2023-11-29 04:46:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:28,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:28,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161119447] [2023-11-29 04:46:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161119447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082619937] [2023-11-29 04:46:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:28,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:28,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 235 [2023-11-29 04:46:28,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 194 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 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-29 04:46:28,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:28,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 235 [2023-11-29 04:46:28,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:28,223 INFO L124 PetriNetUnfolderBase]: 195/1632 cut-off events. [2023-11-29 04:46:28,223 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-29 04:46:28,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1632 events. 195/1632 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12808 event pairs, 57 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1923. Up to 204 conditions per place. [2023-11-29 04:46:28,233 INFO L140 encePairwiseOnDemand]: 215/235 looper letters, 32 selfloop transitions, 14 changer transitions 0/213 dead transitions. [2023-11-29 04:46:28,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 213 transitions, 538 flow [2023-11-29 04:46:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-11-29 04:46:28,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8780141843971632 [2023-11-29 04:46:28,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-11-29 04:46:28,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-11-29 04:46:28,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:28,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-11-29 04:46:28,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,240 INFO L175 Difference]: Start difference. First operand has 195 places, 194 transitions, 403 flow. Second operand 3 states and 619 transitions. [2023-11-29 04:46:28,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 213 transitions, 538 flow [2023-11-29 04:46:28,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 213 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:28,243 INFO L231 Difference]: Finished difference. Result has 197 places, 208 transitions, 523 flow [2023-11-29 04:46:28,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=197, PETRI_TRANSITIONS=208} [2023-11-29 04:46:28,244 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -28 predicate places. [2023-11-29 04:46:28,244 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 208 transitions, 523 flow [2023-11-29 04:46:28,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 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-29 04:46:28,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:28,245 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:28,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:46:28,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:28,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2071956031, now seen corresponding path program 1 times [2023-11-29 04:46:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189073101] [2023-11-29 04:46:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-29 04:46:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189073101] [2023-11-29 04:46:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189073101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:28,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:46:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408937685] [2023-11-29 04:46:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:28,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:46:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:46:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:28,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235 [2023-11-29 04:46:28,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 208 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:28,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235 [2023-11-29 04:46:28,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:28,539 INFO L124 PetriNetUnfolderBase]: 130/1525 cut-off events. [2023-11-29 04:46:28,539 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-29 04:46:28,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1525 events. 130/1525 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 11783 event pairs, 41 based on Foata normal form. 1/1329 useless extension candidates. Maximal degree in co-relation 1758. Up to 120 conditions per place. [2023-11-29 04:46:28,547 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 17 selfloop transitions, 0 changer transitions 4/211 dead transitions. [2023-11-29 04:46:28,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 211 transitions, 571 flow [2023-11-29 04:46:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:46:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:46:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1002 transitions. [2023-11-29 04:46:28,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8527659574468085 [2023-11-29 04:46:28,551 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1002 transitions. [2023-11-29 04:46:28,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1002 transitions. [2023-11-29 04:46:28,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:28,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1002 transitions. [2023-11-29 04:46:28,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,557 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,557 INFO L175 Difference]: Start difference. First operand has 197 places, 208 transitions, 523 flow. Second operand 5 states and 1002 transitions. [2023-11-29 04:46:28,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 211 transitions, 571 flow [2023-11-29 04:46:28,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 211 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:28,564 INFO L231 Difference]: Finished difference. Result has 202 places, 207 transitions, 499 flow [2023-11-29 04:46:28,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=202, PETRI_TRANSITIONS=207} [2023-11-29 04:46:28,565 INFO L281 CegarLoopForPetriNet]: 225 programPoint places, -23 predicate places. [2023-11-29 04:46:28,565 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 207 transitions, 499 flow [2023-11-29 04:46:28,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:28,566 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:28,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:46:28,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2023-11-29 04:46:28,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -192347574, now seen corresponding path program 1 times [2023-11-29 04:46:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:28,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933744124] [2023-11-29 04:46:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:46:28,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:46:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:46:28,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:46:28,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:46:28,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 44 remaining) [2023-11-29 04:46:28,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2023-11-29 04:46:28,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2023-11-29 04:46:28,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2023-11-29 04:46:28,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2023-11-29 04:46:28,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2023-11-29 04:46:28,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2023-11-29 04:46:28,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2023-11-29 04:46:28,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 04:46:28,610 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:28,610 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 04:46:28,610 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-29 04:46:28,652 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:46:28,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 313 transitions, 644 flow [2023-11-29 04:46:28,694 INFO L124 PetriNetUnfolderBase]: 24/353 cut-off events. [2023-11-29 04:46:28,694 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 04:46:28,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 353 events. 24/353 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1103 event pairs, 0 based on Foata normal form. 0/282 useless extension candidates. Maximal degree in co-relation 265. Up to 8 conditions per place. [2023-11-29 04:46:28,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 313 transitions, 644 flow [2023-11-29 04:46:28,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 313 transitions, 644 flow [2023-11-29 04:46:28,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:46:28,702 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;@2392b8cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:46:28,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-11-29 04:46:28,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:46:28,703 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-29 04:46:28,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:46:28,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:28,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:28,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1268620496, now seen corresponding path program 1 times [2023-11-29 04:46:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73832604] [2023-11-29 04:46:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73832604] [2023-11-29 04:46:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73832604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436231948] [2023-11-29 04:46:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:28,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:28,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:28,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 313 [2023-11-29 04:46:28,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 313 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:28,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 313 [2023-11-29 04:46:28,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:29,459 INFO L124 PetriNetUnfolderBase]: 829/4762 cut-off events. [2023-11-29 04:46:29,459 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-11-29 04:46:29,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6020 conditions, 4762 events. 829/4762 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 48976 event pairs, 630 based on Foata normal form. 847/4809 useless extension candidates. Maximal degree in co-relation 4923. Up to 1033 conditions per place. [2023-11-29 04:46:29,517 INFO L140 encePairwiseOnDemand]: 286/313 looper letters, 24 selfloop transitions, 2 changer transitions 1/273 dead transitions. [2023-11-29 04:46:29,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 273 transitions, 616 flow [2023-11-29 04:46:29,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2023-11-29 04:46:29,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8785942492012779 [2023-11-29 04:46:29,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2023-11-29 04:46:29,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2023-11-29 04:46:29,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:29,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2023-11-29 04:46:29,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,526 INFO L175 Difference]: Start difference. First operand has 299 places, 313 transitions, 644 flow. Second operand 3 states and 825 transitions. [2023-11-29 04:46:29,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 273 transitions, 616 flow [2023-11-29 04:46:29,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 273 transitions, 614 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-29 04:46:29,533 INFO L231 Difference]: Finished difference. Result has 272 places, 272 transitions, 564 flow [2023-11-29 04:46:29,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=272, PETRI_TRANSITIONS=272} [2023-11-29 04:46:29,534 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -27 predicate places. [2023-11-29 04:46:29,534 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 272 transitions, 564 flow [2023-11-29 04:46:29,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:29,535 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] [2023-11-29 04:46:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:46:29,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:29,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:29,535 INFO L85 PathProgramCache]: Analyzing trace with hash 779107608, now seen corresponding path program 1 times [2023-11-29 04:46:29,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:29,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572710785] [2023-11-29 04:46:29,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:29,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572710785] [2023-11-29 04:46:29,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572710785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:29,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783731004] [2023-11-29 04:46:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:29,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:29,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 313 [2023-11-29 04:46:29,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:29,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 313 [2023-11-29 04:46:29,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:29,786 INFO L124 PetriNetUnfolderBase]: 97/1244 cut-off events. [2023-11-29 04:46:29,786 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-29 04:46:29,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1244 events. 97/1244 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8850 event pairs, 42 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1349. Up to 85 conditions per place. [2023-11-29 04:46:29,801 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2023-11-29 04:46:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 271 transitions, 590 flow [2023-11-29 04:46:29,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2023-11-29 04:46:29,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8785942492012779 [2023-11-29 04:46:29,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2023-11-29 04:46:29,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2023-11-29 04:46:29,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:29,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2023-11-29 04:46:29,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,811 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,811 INFO L175 Difference]: Start difference. First operand has 272 places, 272 transitions, 564 flow. Second operand 3 states and 825 transitions. [2023-11-29 04:46:29,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 271 transitions, 590 flow [2023-11-29 04:46:29,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 271 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:29,817 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 562 flow [2023-11-29 04:46:29,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2023-11-29 04:46:29,818 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -29 predicate places. [2023-11-29 04:46:29,818 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 562 flow [2023-11-29 04:46:29,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:29,819 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] [2023-11-29 04:46:29,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:46:29,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:29,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -506970348, now seen corresponding path program 1 times [2023-11-29 04:46:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032386584] [2023-11-29 04:46:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:29,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:29,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032386584] [2023-11-29 04:46:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032386584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:29,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:29,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810756031] [2023-11-29 04:46:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:29,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:29,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 313 [2023-11-29 04:46:29,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:29,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:29,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 313 [2023-11-29 04:46:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:30,335 INFO L124 PetriNetUnfolderBase]: 335/2641 cut-off events. [2023-11-29 04:46:30,336 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-29 04:46:30,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3124 conditions, 2641 events. 335/2641 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 23615 event pairs, 220 based on Foata normal form. 0/2180 useless extension candidates. Maximal degree in co-relation 3092. Up to 382 conditions per place. [2023-11-29 04:46:30,355 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 21 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2023-11-29 04:46:30,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 270 transitions, 606 flow [2023-11-29 04:46:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2023-11-29 04:46:30,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8594249201277955 [2023-11-29 04:46:30,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 807 transitions. [2023-11-29 04:46:30,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 807 transitions. [2023-11-29 04:46:30,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:30,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 807 transitions. [2023-11-29 04:46:30,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:30,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:30,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:30,365 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 562 flow. Second operand 3 states and 807 transitions. [2023-11-29 04:46:30,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 270 transitions, 606 flow [2023-11-29 04:46:30,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 270 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:30,371 INFO L231 Difference]: Finished difference. Result has 269 places, 270 transitions, 560 flow [2023-11-29 04:46:30,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=269, PETRI_TRANSITIONS=270} [2023-11-29 04:46:30,371 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -30 predicate places. [2023-11-29 04:46:30,371 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 270 transitions, 560 flow [2023-11-29 04:46:30,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:30,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:30,372 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] [2023-11-29 04:46:30,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:46:30,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:30,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash 944996821, now seen corresponding path program 1 times [2023-11-29 04:46:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167241663] [2023-11-29 04:46:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:30,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-29 04:46:30,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:30,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167241663] [2023-11-29 04:46:30,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167241663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:30,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:30,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:30,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766640705] [2023-11-29 04:46:30,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:30,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:30,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:30,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:30,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 313 [2023-11-29 04:46:30,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 270 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:30,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:30,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 313 [2023-11-29 04:46:30,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:31,232 INFO L124 PetriNetUnfolderBase]: 985/6446 cut-off events. [2023-11-29 04:46:31,233 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2023-11-29 04:46:31,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7745 conditions, 6446 events. 985/6446 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 69807 event pairs, 630 based on Foata normal form. 0/5424 useless extension candidates. Maximal degree in co-relation 7705. Up to 1120 conditions per place. [2023-11-29 04:46:31,328 INFO L140 encePairwiseOnDemand]: 303/313 looper letters, 27 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2023-11-29 04:46:31,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 261 transitions, 598 flow [2023-11-29 04:46:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2023-11-29 04:46:31,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8349307774227902 [2023-11-29 04:46:31,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 784 transitions. [2023-11-29 04:46:31,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 784 transitions. [2023-11-29 04:46:31,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:31,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 784 transitions. [2023-11-29 04:46:31,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,338 INFO L175 Difference]: Start difference. First operand has 269 places, 270 transitions, 560 flow. Second operand 3 states and 784 transitions. [2023-11-29 04:46:31,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 261 transitions, 598 flow [2023-11-29 04:46:31,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 261 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:31,344 INFO L231 Difference]: Finished difference. Result has 260 places, 261 transitions, 540 flow [2023-11-29 04:46:31,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=260, PETRI_TRANSITIONS=261} [2023-11-29 04:46:31,344 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -39 predicate places. [2023-11-29 04:46:31,345 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 261 transitions, 540 flow [2023-11-29 04:46:31,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:31,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:31,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:46:31,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:31,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1139595751, now seen corresponding path program 1 times [2023-11-29 04:46:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:31,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682929286] [2023-11-29 04:46:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:31,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682929286] [2023-11-29 04:46:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682929286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:31,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:31,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295073192] [2023-11-29 04:46:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:31,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:31,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:31,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:31,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 313 [2023-11-29 04:46:31,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 261 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:31,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 313 [2023-11-29 04:46:31,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:31,663 INFO L124 PetriNetUnfolderBase]: 190/1800 cut-off events. [2023-11-29 04:46:31,664 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-29 04:46:31,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 1800 events. 190/1800 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13811 event pairs, 108 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 2026. Up to 196 conditions per place. [2023-11-29 04:46:31,680 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 15 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2023-11-29 04:46:31,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 260 transitions, 572 flow [2023-11-29 04:46:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 819 transitions. [2023-11-29 04:46:31,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8722044728434505 [2023-11-29 04:46:31,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 819 transitions. [2023-11-29 04:46:31,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 819 transitions. [2023-11-29 04:46:31,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:31,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 819 transitions. [2023-11-29 04:46:31,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,690 INFO L175 Difference]: Start difference. First operand has 260 places, 261 transitions, 540 flow. Second operand 3 states and 819 transitions. [2023-11-29 04:46:31,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 260 transitions, 572 flow [2023-11-29 04:46:31,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 260 transitions, 571 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:46:31,696 INFO L231 Difference]: Finished difference. Result has 260 places, 260 transitions, 541 flow [2023-11-29 04:46:31,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=260, PETRI_TRANSITIONS=260} [2023-11-29 04:46:31,697 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -39 predicate places. [2023-11-29 04:46:31,697 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 260 transitions, 541 flow [2023-11-29 04:46:31,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:31,698 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] [2023-11-29 04:46:31,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:46:31,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:31,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 944944627, now seen corresponding path program 1 times [2023-11-29 04:46:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561531146] [2023-11-29 04:46:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:31,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561531146] [2023-11-29 04:46:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561531146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:31,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84401612] [2023-11-29 04:46:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:31,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:31,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 313 [2023-11-29 04:46:31,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 260 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:31,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 313 [2023-11-29 04:46:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:34,453 INFO L124 PetriNetUnfolderBase]: 4600/23472 cut-off events. [2023-11-29 04:46:34,453 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-11-29 04:46:34,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29931 conditions, 23472 events. 4600/23472 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 321876 event pairs, 1667 based on Foata normal form. 0/20147 useless extension candidates. Maximal degree in co-relation 29891. Up to 4132 conditions per place. [2023-11-29 04:46:34,581 INFO L140 encePairwiseOnDemand]: 283/313 looper letters, 48 selfloop transitions, 21 changer transitions 0/289 dead transitions. [2023-11-29 04:46:34,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 289 transitions, 747 flow [2023-11-29 04:46:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2023-11-29 04:46:34,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8690095846645367 [2023-11-29 04:46:34,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2023-11-29 04:46:34,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2023-11-29 04:46:34,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:34,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2023-11-29 04:46:34,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:34,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:34,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:34,588 INFO L175 Difference]: Start difference. First operand has 260 places, 260 transitions, 541 flow. Second operand 3 states and 816 transitions. [2023-11-29 04:46:34,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 289 transitions, 747 flow [2023-11-29 04:46:34,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 289 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:34,593 INFO L231 Difference]: Finished difference. Result has 262 places, 281 transitions, 723 flow [2023-11-29 04:46:34,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=262, PETRI_TRANSITIONS=281} [2023-11-29 04:46:34,594 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -37 predicate places. [2023-11-29 04:46:34,594 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 281 transitions, 723 flow [2023-11-29 04:46:34,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:34,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:34,594 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:34,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 04:46:34,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:34,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1905104071, now seen corresponding path program 1 times [2023-11-29 04:46:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:34,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336287756] [2023-11-29 04:46:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:34,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 04:46:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:34,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336287756] [2023-11-29 04:46:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336287756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:34,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:46:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173946555] [2023-11-29 04:46:34,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:46:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:46:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:34,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 313 [2023-11-29 04:46:34,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 281 transitions, 723 flow. Second operand has 5 states, 5 states have (on average 265.6) internal successors, (1328), 5 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:34,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:34,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 313 [2023-11-29 04:46:34,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:35,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread1of3ForFork0_release_#t~nondet4#1=|v_thrThread1of3ForFork0_release_#t~nondet4#1_5|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread1of3ForFork0_release_#t~nondet4#1, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1][93], [281#L1019true, 322#true, 44#L1046-4true, 236#L1019true, 316#(= |#race~len~0| 0), Black: 324#(= |#race~next~0| 0), thrThread1of3ForFork0InUse, 328#true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 54#$Ultimate##0true]) [2023-11-29 04:46:35,488 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-29 04:46:35,488 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 04:46:35,489 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-29 04:46:35,489 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 04:46:35,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1001] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread1of3ForFork0_release_#t~nondet4#1=|v_thrThread1of3ForFork0_release_#t~nondet4#1_5|, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread1of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread1of3ForFork0_release_#t~nondet4#1, thrThread1of3ForFork0_assume_abort_if_not_~cond#1, thrThread1of3ForFork0_assume_abort_if_not_#in~cond#1][93], [281#L1019true, 322#true, 44#L1046-4true, 236#L1019true, 316#(= |#race~len~0| 0), Black: 324#(= |#race~next~0| 0), thrThread1of3ForFork0InUse, 328#true, thrThread2of3ForFork0InUse, 166#L1013true, thrThread3of3ForFork0InUse]) [2023-11-29 04:46:35,909 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2023-11-29 04:46:35,909 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 04:46:35,909 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 04:46:35,909 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-29 04:46:36,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1078] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of3ForFork0_release_#t~nondet4#1=|v_thrThread3of3ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread3of3ForFork0_assume_abort_if_not_~cond#1, thrThread3of3ForFork0_release_#t~nondet4#1, thrThread3of3ForFork0_assume_abort_if_not_#in~cond#1][175], [281#L1019true, 235#L1019true, 324#(= |#race~next~0| 0), 44#L1046-4true, 316#(= |#race~len~0| 0), Black: 322#true, thrThread1of3ForFork0InUse, 328#true, thrThread2of3ForFork0InUse, thrThread3of3ForFork0InUse, 158#L1028-6true]) [2023-11-29 04:46:36,338 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-29 04:46:36,338 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 04:46:36,338 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-29 04:46:36,338 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 04:46:36,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of3ForFork0_release_#t~nondet4#1=|v_thrThread2of3ForFork0_release_#t~nondet4#1_5|, thrThread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of3ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of3ForFork0_release_#t~nondet4#1, thrThread2of3ForFork0_assume_abort_if_not_~cond#1, thrThread2of3ForFork0_assume_abort_if_not_#in~cond#1][129], [281#L1019true, 322#true, 235#L1019true, 44#L1046-4true, 316#(= |#race~len~0| 0), 236#L1019true, Black: 324#(= |#race~next~0| 0), thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 328#true, thrThread3of3ForFork0InUse]) [2023-11-29 04:46:36,375 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-29 04:46:36,375 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 04:46:36,375 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 04:46:36,375 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-29 04:46:36,855 INFO L124 PetriNetUnfolderBase]: 2516/17795 cut-off events. [2023-11-29 04:46:36,856 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2023-11-29 04:46:36,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22316 conditions, 17795 events. 2516/17795 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 243767 event pairs, 1056 based on Foata normal form. 1/15469 useless extension candidates. Maximal degree in co-relation 22275. Up to 2203 conditions per place. [2023-11-29 04:46:37,025 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 20 selfloop transitions, 0 changer transitions 4/284 dead transitions. [2023-11-29 04:46:37,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 284 transitions, 777 flow [2023-11-29 04:46:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:46:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:46:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1340 transitions. [2023-11-29 04:46:37,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8562300319488818 [2023-11-29 04:46:37,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1340 transitions. [2023-11-29 04:46:37,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1340 transitions. [2023-11-29 04:46:37,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:37,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1340 transitions. [2023-11-29 04:46:37,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:37,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 313.0) internal successors, (1878), 6 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:37,037 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 313.0) internal successors, (1878), 6 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:37,038 INFO L175 Difference]: Start difference. First operand has 262 places, 281 transitions, 723 flow. Second operand 5 states and 1340 transitions. [2023-11-29 04:46:37,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 284 transitions, 777 flow [2023-11-29 04:46:37,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 284 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:37,065 INFO L231 Difference]: Finished difference. Result has 267 places, 280 transitions, 685 flow [2023-11-29 04:46:37,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=685, PETRI_PLACES=267, PETRI_TRANSITIONS=280} [2023-11-29 04:46:37,066 INFO L281 CegarLoopForPetriNet]: 299 programPoint places, -32 predicate places. [2023-11-29 04:46:37,066 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 280 transitions, 685 flow [2023-11-29 04:46:37,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 265.6) internal successors, (1328), 5 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:37,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:37,067 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:37,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 04:46:37,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 53 more)] === [2023-11-29 04:46:37,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:37,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1060100949, now seen corresponding path program 1 times [2023-11-29 04:46:37,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:37,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369393319] [2023-11-29 04:46:37,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:37,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:46:37,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:46:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:46:37,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:46:37,116 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:46:37,116 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 56 remaining) [2023-11-29 04:46:37,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2023-11-29 04:46:37,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2023-11-29 04:46:37,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2023-11-29 04:46:37,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2023-11-29 04:46:37,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2023-11-29 04:46:37,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2023-11-29 04:46:37,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2023-11-29 04:46:37,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2023-11-29 04:46:37,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2023-11-29 04:46:37,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2023-11-29 04:46:37,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2023-11-29 04:46:37,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2023-11-29 04:46:37,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (23 of 56 remaining) [2023-11-29 04:46:37,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (22 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2023-11-29 04:46:37,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2023-11-29 04:46:37,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2023-11-29 04:46:37,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2023-11-29 04:46:37,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr11ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2023-11-29 04:46:37,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:46:37,124 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:37,125 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-29 04:46:37,125 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-29 04:46:37,176 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 04:46:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 391 transitions, 810 flow [2023-11-29 04:46:37,258 INFO L124 PetriNetUnfolderBase]: 31/445 cut-off events. [2023-11-29 04:46:37,258 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 04:46:37,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 445 events. 31/445 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1644 event pairs, 0 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 361. Up to 10 conditions per place. [2023-11-29 04:46:37,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 373 places, 391 transitions, 810 flow [2023-11-29 04:46:37,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 373 places, 391 transitions, 810 flow [2023-11-29 04:46:37,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:46:37,268 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;@2392b8cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:46:37,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2023-11-29 04:46:37,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:46:37,270 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-11-29 04:46:37,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:46:37,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:37,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:37,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:46:37,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -806232649, now seen corresponding path program 1 times [2023-11-29 04:46:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:37,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950704718] [2023-11-29 04:46:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:37,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950704718] [2023-11-29 04:46:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950704718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:37,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194759335] [2023-11-29 04:46:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:37,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:37,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:37,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 391 [2023-11-29 04:46:37,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 391 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:37,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:37,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 391 [2023-11-29 04:46:37,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:41,952 INFO L124 PetriNetUnfolderBase]: 8203/35349 cut-off events. [2023-11-29 04:46:41,952 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2023-11-29 04:46:42,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46898 conditions, 35349 events. 8203/35349 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1078. Compared 493260 event pairs, 6804 based on Foata normal form. 7100/36849 useless extension candidates. Maximal degree in co-relation 38494. Up to 9608 conditions per place. [2023-11-29 04:46:42,389 INFO L140 encePairwiseOnDemand]: 357/391 looper letters, 31 selfloop transitions, 2 changer transitions 1/341 dead transitions. [2023-11-29 04:46:42,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 341 transitions, 776 flow [2023-11-29 04:46:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2023-11-29 04:46:42,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.876385336743393 [2023-11-29 04:46:42,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2023-11-29 04:46:42,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2023-11-29 04:46:42,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:42,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2023-11-29 04:46:42,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 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-29 04:46:42,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:42,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:42,401 INFO L175 Difference]: Start difference. First operand has 373 places, 391 transitions, 810 flow. Second operand 3 states and 1028 transitions. [2023-11-29 04:46:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 341 transitions, 776 flow [2023-11-29 04:46:42,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 770 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-29 04:46:42,411 INFO L231 Difference]: Finished difference. Result has 339 places, 340 transitions, 706 flow [2023-11-29 04:46:42,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=339, PETRI_TRANSITIONS=340} [2023-11-29 04:46:42,412 INFO L281 CegarLoopForPetriNet]: 373 programPoint places, -34 predicate places. [2023-11-29 04:46:42,412 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 340 transitions, 706 flow [2023-11-29 04:46:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:42,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:42,413 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] [2023-11-29 04:46:42,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:46:42,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:46:42,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 538496696, now seen corresponding path program 1 times [2023-11-29 04:46:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602892845] [2023-11-29 04:46:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:42,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602892845] [2023-11-29 04:46:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602892845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829389545] [2023-11-29 04:46:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:42,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:42,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:42,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:42,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 391 [2023-11-29 04:46:42,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 340 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:42,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:42,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 391 [2023-11-29 04:46:42,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:43,146 INFO L124 PetriNetUnfolderBase]: 379/3859 cut-off events. [2023-11-29 04:46:43,146 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-29 04:46:43,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 3859 events. 379/3859 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 38264 event pairs, 204 based on Foata normal form. 0/3136 useless extension candidates. Maximal degree in co-relation 4288. Up to 328 conditions per place. [2023-11-29 04:46:43,182 INFO L140 encePairwiseOnDemand]: 388/391 looper letters, 15 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2023-11-29 04:46:43,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 339 transitions, 738 flow [2023-11-29 04:46:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1029 transitions. [2023-11-29 04:46:43,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8772378516624041 [2023-11-29 04:46:43,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1029 transitions. [2023-11-29 04:46:43,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1029 transitions. [2023-11-29 04:46:43,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:43,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1029 transitions. [2023-11-29 04:46:43,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:43,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:43,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:43,192 INFO L175 Difference]: Start difference. First operand has 339 places, 340 transitions, 706 flow. Second operand 3 states and 1029 transitions. [2023-11-29 04:46:43,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 339 transitions, 738 flow [2023-11-29 04:46:43,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 339 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:43,199 INFO L231 Difference]: Finished difference. Result has 337 places, 339 transitions, 704 flow [2023-11-29 04:46:43,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=337, PETRI_TRANSITIONS=339} [2023-11-29 04:46:43,200 INFO L281 CegarLoopForPetriNet]: 373 programPoint places, -36 predicate places. [2023-11-29 04:46:43,200 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 339 transitions, 704 flow [2023-11-29 04:46:43,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.3333333333333) internal successors, (1015), 3 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:43,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:43,200 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] [2023-11-29 04:46:43,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 04:46:43,201 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:46:43,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 929006683, now seen corresponding path program 1 times [2023-11-29 04:46:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569877126] [2023-11-29 04:46:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569877126] [2023-11-29 04:46:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569877126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440058259] [2023-11-29 04:46:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:43,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:43,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 391 [2023-11-29 04:46:43,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 339 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:43,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:43,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 391 [2023-11-29 04:46:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:45,022 INFO L124 PetriNetUnfolderBase]: 2303/13670 cut-off events. [2023-11-29 04:46:45,022 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2023-11-29 04:46:45,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16654 conditions, 13670 events. 2303/13670 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 169806 event pairs, 1720 based on Foata normal form. 0/11337 useless extension candidates. Maximal degree in co-relation 16621. Up to 2507 conditions per place. [2023-11-29 04:46:45,152 INFO L140 encePairwiseOnDemand]: 388/391 looper letters, 26 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2023-11-29 04:46:45,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 338 transitions, 758 flow [2023-11-29 04:46:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2023-11-29 04:46:45,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8584825234441603 [2023-11-29 04:46:45,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1007 transitions. [2023-11-29 04:46:45,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1007 transitions. [2023-11-29 04:46:45,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:45,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1007 transitions. [2023-11-29 04:46:45,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.6666666666667) internal successors, (1007), 3 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:45,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:45,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:45,159 INFO L175 Difference]: Start difference. First operand has 337 places, 339 transitions, 704 flow. Second operand 3 states and 1007 transitions. [2023-11-29 04:46:45,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 338 transitions, 758 flow [2023-11-29 04:46:45,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 338 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:45,163 INFO L231 Difference]: Finished difference. Result has 336 places, 338 transitions, 702 flow [2023-11-29 04:46:45,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=336, PETRI_TRANSITIONS=338} [2023-11-29 04:46:45,164 INFO L281 CegarLoopForPetriNet]: 373 programPoint places, -37 predicate places. [2023-11-29 04:46:45,164 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 338 transitions, 702 flow [2023-11-29 04:46:45,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:45,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:45,165 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] [2023-11-29 04:46:45,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 04:46:45,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:46:45,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1151306404, now seen corresponding path program 1 times [2023-11-29 04:46:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:45,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609091061] [2023-11-29 04:46:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609091061] [2023-11-29 04:46:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609091061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:45,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:45,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978171565] [2023-11-29 04:46:45,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:45,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:45,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:45,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:45,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 391 [2023-11-29 04:46:45,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 338 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:45,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:45,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 391 [2023-11-29 04:46:45,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:52,138 INFO L124 PetriNetUnfolderBase]: 9761/49721 cut-off events. [2023-11-29 04:46:52,139 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2023-11-29 04:46:52,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61528 conditions, 49721 events. 9761/49721 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 741616 event pairs, 6804 based on Foata normal form. 0/41842 useless extension candidates. Maximal degree in co-relation 61487. Up to 10598 conditions per place. [2023-11-29 04:46:52,765 INFO L140 encePairwiseOnDemand]: 379/391 looper letters, 34 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2023-11-29 04:46:52,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 327 transitions, 750 flow [2023-11-29 04:46:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2023-11-29 04:46:52,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8320545609548167 [2023-11-29 04:46:52,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2023-11-29 04:46:52,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2023-11-29 04:46:52,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:52,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2023-11-29 04:46:52,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:52,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:52,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:52,774 INFO L175 Difference]: Start difference. First operand has 336 places, 338 transitions, 702 flow. Second operand 3 states and 976 transitions. [2023-11-29 04:46:52,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 327 transitions, 750 flow [2023-11-29 04:46:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 327 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:46:52,781 INFO L231 Difference]: Finished difference. Result has 325 places, 327 transitions, 678 flow [2023-11-29 04:46:52,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=325, PETRI_TRANSITIONS=327} [2023-11-29 04:46:52,781 INFO L281 CegarLoopForPetriNet]: 373 programPoint places, -48 predicate places. [2023-11-29 04:46:52,782 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 327 transitions, 678 flow [2023-11-29 04:46:52,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:52,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:52,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:52,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 04:46:52,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:46:52,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1451987616, now seen corresponding path program 1 times [2023-11-29 04:46:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:52,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905755615] [2023-11-29 04:46:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905755615] [2023-11-29 04:46:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905755615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:52,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:52,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859953210] [2023-11-29 04:46:52,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:52,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:52,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 391 [2023-11-29 04:46:52,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 327 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:52,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:52,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 391 [2023-11-29 04:46:52,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:46:54,041 INFO L124 PetriNetUnfolderBase]: 1021/7404 cut-off events. [2023-11-29 04:46:54,041 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2023-11-29 04:46:54,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 7404 events. 1021/7404 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 80533 event pairs, 684 based on Foata normal form. 0/6219 useless extension candidates. Maximal degree in co-relation 8654. Up to 1028 conditions per place. [2023-11-29 04:46:54,127 INFO L140 encePairwiseOnDemand]: 388/391 looper letters, 19 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2023-11-29 04:46:54,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 326 transitions, 718 flow [2023-11-29 04:46:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:46:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1021 transitions. [2023-11-29 04:46:54,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8704177323103154 [2023-11-29 04:46:54,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1021 transitions. [2023-11-29 04:46:54,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1021 transitions. [2023-11-29 04:46:54,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:46:54,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1021 transitions. [2023-11-29 04:46:54,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:54,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:54,134 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:54,134 INFO L175 Difference]: Start difference. First operand has 325 places, 327 transitions, 678 flow. Second operand 3 states and 1021 transitions. [2023-11-29 04:46:54,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 326 transitions, 718 flow [2023-11-29 04:46:54,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 326 transitions, 717 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:46:54,139 INFO L231 Difference]: Finished difference. Result has 325 places, 326 transitions, 679 flow [2023-11-29 04:46:54,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=325, PETRI_TRANSITIONS=326} [2023-11-29 04:46:54,139 INFO L281 CegarLoopForPetriNet]: 373 programPoint places, -48 predicate places. [2023-11-29 04:46:54,139 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 326 transitions, 679 flow [2023-11-29 04:46:54,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:54,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:46:54,140 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] [2023-11-29 04:46:54,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 04:46:54,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:46:54,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -175683872, now seen corresponding path program 1 times [2023-11-29 04:46:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:54,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128652008] [2023-11-29 04:46:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:46:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128652008] [2023-11-29 04:46:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128652008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038168373] [2023-11-29 04:46:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:54,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:46:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:54,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:54,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 391 [2023-11-29 04:46:54,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 326 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:54,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:46:54,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 391 [2023-11-29 04:46:54,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:47:37,971 INFO L124 PetriNetUnfolderBase]: 93275/348612 cut-off events. [2023-11-29 04:47:37,972 INFO L125 PetriNetUnfolderBase]: For 6739/6739 co-relation queries the response was YES. [2023-11-29 04:47:40,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470088 conditions, 348612 events. 93275/348612 cut-off events. For 6739/6739 co-relation queries the response was YES. Maximal size of possible extension queue 9903. Compared 6343913 event pairs, 36288 based on Foata normal form. 0/297401 useless extension candidates. Maximal degree in co-relation 470047. Up to 76888 conditions per place. [2023-11-29 04:47:42,366 INFO L140 encePairwiseOnDemand]: 351/391 looper letters, 64 selfloop transitions, 28 changer transitions 0/365 dead transitions. [2023-11-29 04:47:42,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 365 transitions, 956 flow [2023-11-29 04:47:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:47:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:47:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2023-11-29 04:47:42,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8635976129582268 [2023-11-29 04:47:42,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1013 transitions. [2023-11-29 04:47:42,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1013 transitions. [2023-11-29 04:47:42,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:47:42,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1013 transitions. [2023-11-29 04:47:42,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:47:42,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:47:42,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:47:42,374 INFO L175 Difference]: Start difference. First operand has 325 places, 326 transitions, 679 flow. Second operand 3 states and 1013 transitions. [2023-11-29 04:47:42,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 365 transitions, 956 flow [2023-11-29 04:47:42,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 365 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:47:42,385 INFO L231 Difference]: Finished difference. Result has 327 places, 354 transitions, 923 flow [2023-11-29 04:47:42,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=327, PETRI_TRANSITIONS=354} [2023-11-29 04:47:42,386 INFO L281 CegarLoopForPetriNet]: 373 programPoint places, -46 predicate places. [2023-11-29 04:47:42,386 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 354 transitions, 923 flow [2023-11-29 04:47:42,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:47:42,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:47:42,387 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] [2023-11-29 04:47:42,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 04:47:42,387 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2023-11-29 04:47:42,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 158121107, now seen corresponding path program 1 times [2023-11-29 04:47:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:47:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216537234] [2023-11-29 04:47:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:47:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:47:42,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216537234] [2023-11-29 04:47:42,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216537234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:42,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:42,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:47:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245277418] [2023-11-29 04:47:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:47:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:47:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:47:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:47:42,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 391 [2023-11-29 04:47:42,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 354 transitions, 923 flow. Second operand has 5 states, 5 states have (on average 327.4) internal successors, (1637), 5 states have internal predecessors, (1637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:47:42,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:47:42,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 391 [2023-11-29 04:47:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:47:56,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1546] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][305], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, 17#$Ultimate##0true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), thrThread4of4ForFork0InUse, 398#(= |#race~next~0| 0), 402#true, 293#L1028-4true]) [2023-11-29 04:47:56,152 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-29 04:47:56,152 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 04:47:56,152 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 04:47:56,152 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 04:47:56,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1469] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][246], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, 17#$Ultimate##0true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 402#true, 293#L1028-4true]) [2023-11-29 04:47:56,213 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-29 04:47:56,214 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 04:47:56,214 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 04:47:56,214 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 04:47:56,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1546] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][305], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 351#$Ultimate##0true, 206#L1019true, 402#true, 293#L1028-4true]) [2023-11-29 04:47:56,753 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-29 04:47:56,753 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 04:47:56,753 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-29 04:47:56,753 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-29 04:48:05,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1546] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][305], [157#L1019true, 50#L1046-4true, 363#L1013true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), thrThread4of4ForFork0InUse, 398#(= |#race~next~0| 0), 402#true, 293#L1028-4true]) [2023-11-29 04:48:05,756 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 04:48:05,756 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 04:48:05,756 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 04:48:05,756 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 04:48:05,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1469] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{#race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread2of4ForFork0_release_#t~nondet4#1=|v_thrThread2of4ForFork0_release_#t~nondet4#1_5|, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread2of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[#race~lock~0, ~lock~0, thrThread2of4ForFork0_release_#t~nondet4#1, thrThread2of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread2of4ForFork0_assume_abort_if_not_~cond#1][246], [157#L1019true, 50#L1046-4true, 363#L1013true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 402#true, 293#L1028-4true]) [2023-11-29 04:48:05,900 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-29 04:48:05,900 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 04:48:05,900 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 04:48:05,900 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-29 04:48:10,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [308#L1027true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 46#L1027true, 402#true]) [2023-11-29 04:48:10,606 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is not cut-off event [2023-11-29 04:48:10,606 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2023-11-29 04:48:10,606 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2023-11-29 04:48:10,606 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2023-11-29 04:48:10,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 39#L1026-2true, 206#L1019true, 402#true, 293#L1028-4true]) [2023-11-29 04:48:10,855 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-29 04:48:10,855 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 04:48:10,856 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 04:48:10,856 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-29 04:48:14,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [308#L1027true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 402#true]) [2023-11-29 04:48:14,117 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,117 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,117 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,117 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [157#L1019true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 46#L1027true, 402#true]) [2023-11-29 04:48:14,125 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,125 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,125 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 04:48:14,125 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-29 04:48:16,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1546] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_~cond#1_7|, thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread3of4ForFork0_release_#t~nondet4#1=|v_thrThread3of4ForFork0_release_#t~nondet4#1_5|} AuxVars[] AssignedVars[thrThread3of4ForFork0_assume_abort_if_not_#in~cond#1, #race~lock~0, ~lock~0, thrThread3of4ForFork0_assume_abort_if_not_~cond#1, thrThread3of4ForFork0_release_#t~nondet4#1][305], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 116#L1027true, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 402#true, 293#L1028-4true]) [2023-11-29 04:48:16,107 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 04:48:16,107 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 04:48:16,107 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 04:48:16,107 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 04:48:16,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [308#L1027true, 359#L1028-6true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 46#L1027true, 402#true]) [2023-11-29 04:48:16,131 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 04:48:16,132 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 04:48:16,132 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 04:48:16,132 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 04:48:16,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1638] L1028-3-->L1028-4: Formula: (= v_~next~0_6 |v_thrThread4of4ForFork0_~end~0#1_11|) InVars {thrThread4of4ForFork0_~end~0#1=|v_thrThread4of4ForFork0_~end~0#1_11|} OutVars{thrThread4of4ForFork0_~end~0#1=|v_thrThread4of4ForFork0_~end~0#1_11|, ~next~0=v_~next~0_6} AuxVars[] AssignedVars[~next~0][382], [157#L1019true, 50#L1046-4true, 158#L1026-1true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 123#L1028-4true, 402#true, 293#L1028-4true]) [2023-11-29 04:48:16,242 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 04:48:16,242 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 04:48:16,242 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 04:48:16,242 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 04:48:16,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [113#L1027true, 157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 28#L1028-4true, 206#L1019true, 402#true]) [2023-11-29 04:48:16,256 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-29 04:48:16,256 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-29 04:48:16,256 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 04:48:16,256 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-29 04:48:17,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [157#L1019true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 402#true]) [2023-11-29 04:48:17,604 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is not cut-off event [2023-11-29 04:48:17,604 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2023-11-29 04:48:17,605 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2023-11-29 04:48:17,605 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2023-11-29 04:48:18,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1638] L1028-3-->L1028-4: Formula: (= v_~next~0_6 |v_thrThread4of4ForFork0_~end~0#1_11|) InVars {thrThread4of4ForFork0_~end~0#1=|v_thrThread4of4ForFork0_~end~0#1_11|} OutVars{thrThread4of4ForFork0_~end~0#1=|v_thrThread4of4ForFork0_~end~0#1_11|, ~next~0=v_~next~0_6} AuxVars[] AssignedVars[~next~0][382], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 128#L1026-2true, 123#L1028-4true, 402#true, 293#L1028-4true]) [2023-11-29 04:48:18,281 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:18,281 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:18,282 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:18,282 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [308#L1027true, 319#L1028-6true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), thrThread4of4ForFork0InUse, 398#(= |#race~next~0| 0), 206#L1019true, 402#true]) [2023-11-29 04:48:19,340 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,340 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,340 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,340 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [133#L1019true, 50#L1046-4true, 364#L1028-6true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 46#L1027true, 206#L1019true, 402#true]) [2023-11-29 04:48:19,341 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,341 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,341 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,341 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [157#L1019true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 28#L1028-4true, 206#L1019true, 402#true]) [2023-11-29 04:48:19,342 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,342 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,342 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,342 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [308#L1027true, 359#L1028-6true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 402#true]) [2023-11-29 04:48:19,876 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,876 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,876 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,876 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [359#L1028-6true, 157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 46#L1027true, 206#L1019true, 402#true]) [2023-11-29 04:48:19,953 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:19,953 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,953 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:19,954 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:22,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [319#L1028-6true, 157#L1019true, 133#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), thrThread4of4ForFork0InUse, 398#(= |#race~next~0| 0), 206#L1019true, 402#true]) [2023-11-29 04:48:22,802 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-29 04:48:22,802 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:22,802 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:22,802 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:23,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [359#L1028-6true, 157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 402#true]) [2023-11-29 04:48:23,391 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-29 04:48:23,391 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:23,391 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:23,392 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:24,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, 101#L1027-1true, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 28#L1028-4true, 206#L1019true, 402#true]) [2023-11-29 04:48:24,338 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-29 04:48:24,338 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 04:48:24,339 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-29 04:48:24,339 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-29 04:48:26,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [157#L1019true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 28#L1028-4true, 22#L1027-2true, 206#L1019true, 402#true]) [2023-11-29 04:48:26,450 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-29 04:48:26,450 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-29 04:48:26,450 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 04:48:26,450 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-29 04:48:29,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [50#L1046-4true, thrThread1of4ForFork0InUse, Black: 396#true, 310#L1019true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 74#L1028-4true, 390#(= |#race~len~0| 0), thrThread4of4ForFork0InUse, 398#(= |#race~next~0| 0), 206#L1019true, 402#true, 293#L1028-4true]) [2023-11-29 04:48:29,351 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2023-11-29 04:48:29,351 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-29 04:48:29,351 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 04:48:29,351 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-29 04:48:30,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [326#L1028-1true, 157#L1019true, 50#L1046-4true, thrThread1of4ForFork0InUse, Black: 396#true, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 28#L1028-4true, 206#L1019true, 402#true]) [2023-11-29 04:48:30,526 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-29 04:48:30,526 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 04:48:30,526 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-29 04:48:30,526 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-29 04:48:32,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [157#L1019true, 62#L1028-2true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, thrThread2of4ForFork0InUse, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 28#L1028-4true, 206#L1019true, 402#true]) [2023-11-29 04:48:32,050 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-29 04:48:32,050 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-29 04:48:32,050 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 04:48:32,051 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-29 04:48:32,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1623] L1016-->L1019: Formula: (and (= v_~lock~0_63 0) (not (= (ite (= v_~lock~0_64 1) 1 0) 0))) InVars {~lock~0=v_~lock~0_64} OutVars{thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thrThread4of4ForFork0_release_#t~nondet4#1=|v_thrThread4of4ForFork0_release_#t~nondet4#1_5|, #race~lock~0=|v_#race~lock~0_72|, ~lock~0=v_~lock~0_63, thrThread4of4ForFork0_assume_abort_if_not_~cond#1=|v_thrThread4of4ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[thrThread4of4ForFork0_assume_abort_if_not_#in~cond#1, thrThread4of4ForFork0_release_#t~nondet4#1, #race~lock~0, ~lock~0, thrThread4of4ForFork0_assume_abort_if_not_~cond#1][348], [359#L1028-6true, 50#L1046-4true, Black: 396#true, thrThread1of4ForFork0InUse, 310#L1019true, thrThread2of4ForFork0InUse, 74#L1028-4true, thrThread3of4ForFork0InUse, 390#(= |#race~len~0| 0), 398#(= |#race~next~0| 0), thrThread4of4ForFork0InUse, 206#L1019true, 402#true]) [2023-11-29 04:48:32,719 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-29 04:48:32,719 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-29 04:48:32,719 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-29 04:48:32,719 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event