./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.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_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:44:44,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:44:44,199 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:44:44,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:44:44,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:44:44,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:44:44,246 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:44:44,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:44:44,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:44:44,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:44:44,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:44:44,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:44:44,256 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:44:44,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:44:44,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:44:44,259 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:44:44,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:44:44,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:44:44,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:44:44,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:44:44,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:44:44,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:44:44,263 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:44:44,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:44:44,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:44:44,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:44:44,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:44:44,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:44:44,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:44:44,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:44:44,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:44:44,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:44:44,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:44:44,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:44:44,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:44:44,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:44:44,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:44:44,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:44:44,271 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:44:44,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:44:44,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:44:44,272 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_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2023-11-26 11:44:44,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:44:44,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:44:44,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:44:44,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:44:44,656 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:44:44,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i [2023-11-26 11:44:47,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:44:48,190 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:44:48,191 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/sv-benchmarks/c/pthread-lit/sssc12_variant-pthread.i [2023-11-26 11:44:48,214 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/data/7defe7fa8/3ff2465035ed4f1f8756fb8532f2c0a6/FLAGbc5f75ae5 [2023-11-26 11:44:48,230 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/data/7defe7fa8/3ff2465035ed4f1f8756fb8532f2c0a6 [2023-11-26 11:44:48,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:44:48,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:44:48,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:44:48,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:44:48,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:44:48,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:44:48" (1/1) ... [2023-11-26 11:44:48,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361fa616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:48, skipping insertion in model container [2023-11-26 11:44:48,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:44:48" (1/1) ... [2023-11-26 11:44:48,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:44:49,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:44:49,079 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:44:49,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:44:49,233 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:44:49,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49 WrapperNode [2023-11-26 11:44:49,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:44:49,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:44:49,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:44:49,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:44:49,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,321 INFO L138 Inliner]: procedures = 273, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-26 11:44:49,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:44:49,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:44:49,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:44:49,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:44:49,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:44:49,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:44:49,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:44:49,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:44:49,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (1/1) ... [2023-11-26 11:44:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:44:49,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:44:49,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:44:49,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8976f79-fb8a-4e9c-a5be-b96ec8c0b3b2/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:44:49,486 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2023-11-26 11:44:49,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2023-11-26 11:44:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:44:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:44:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-26 11:44:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:44:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:44:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-26 11:44:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 11:44:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:44:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:44:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:44:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:44:49,491 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:44:49,717 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:44:49,719 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:44:50,121 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:44:50,158 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:44:50,159 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:44:50,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:50 BoogieIcfgContainer [2023-11-26 11:44:50,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:44:50,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:44:50,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:44:50,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:44:50,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:44:48" (1/3) ... [2023-11-26 11:44:50,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5984c27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:44:50, skipping insertion in model container [2023-11-26 11:44:50,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:44:49" (2/3) ... [2023-11-26 11:44:50,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5984c27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:44:50, skipping insertion in model container [2023-11-26 11:44:50,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:44:50" (3/3) ... [2023-11-26 11:44:50,170 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant-pthread.i [2023-11-26 11:44:50,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:44:50,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:44:50,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-11-26 11:44:50,194 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:44:50,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:44:50,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 169 transitions, 342 flow [2023-11-26 11:44:50,486 INFO L124 PetriNetUnfolderBase]: 9/182 cut-off events. [2023-11-26 11:44:50,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:44:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 182 events. 9/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 156 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2023-11-26 11:44:50,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 169 transitions, 342 flow [2023-11-26 11:44:50,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 169 transitions, 342 flow [2023-11-26 11:44:50,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:44:50,523 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;@463fdd9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:44:50,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-26 11:44:50,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:44:50,533 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 11:44:50,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:44:50,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:50,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:50,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-11-26 11:44:50,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash 497588608, now seen corresponding path program 1 times [2023-11-26 11:44:50,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:50,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630724981] [2023-11-26 11:44:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630724981] [2023-11-26 11:44:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630724981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954121822] [2023-11-26 11:44:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:50,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:50,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:50,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:50,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2023-11-26 11:44:50,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 169 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:50,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:50,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2023-11-26 11:44:50,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:51,002 INFO L124 PetriNetUnfolderBase]: 3/156 cut-off events. [2023-11-26 11:44:51,002 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:44:51,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 3/156 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 12/147 useless extension candidates. Maximal degree in co-relation 92. Up to 11 conditions per place. [2023-11-26 11:44:51,005 INFO L140 encePairwiseOnDemand]: 160/169 looper letters, 10 selfloop transitions, 2 changer transitions 1/152 dead transitions. [2023-11-26 11:44:51,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 152 transitions, 332 flow [2023-11-26 11:44:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-11-26 11:44:51,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9132149901380671 [2023-11-26 11:44:51,026 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-11-26 11:44:51,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-11-26 11:44:51,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:51,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-11-26 11:44:51,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,048 INFO L175 Difference]: Start difference. First operand has 164 places, 169 transitions, 342 flow. Second operand 3 states and 463 transitions. [2023-11-26 11:44:51,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 152 transitions, 332 flow [2023-11-26 11:44:51,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 332 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:44:51,059 INFO L231 Difference]: Finished difference. Result has 154 places, 151 transitions, 310 flow [2023-11-26 11:44:51,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=154, PETRI_TRANSITIONS=151} [2023-11-26 11:44:51,065 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2023-11-26 11:44:51,066 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 310 flow [2023-11-26 11:44:51,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:51,067 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] [2023-11-26 11:44:51,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:44:51,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-11-26 11:44:51,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1842425144, now seen corresponding path program 1 times [2023-11-26 11:44:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935605204] [2023-11-26 11:44:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:51,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935605204] [2023-11-26 11:44:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935605204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:51,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053872840] [2023-11-26 11:44:51,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:51,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:51,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2023-11-26 11:44:51,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:51,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2023-11-26 11:44:51,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:51,279 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2023-11-26 11:44:51,283 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:44:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 154 events. 3/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 141. Up to 11 conditions per place. [2023-11-26 11:44:51,286 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 10 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2023-11-26 11:44:51,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 150 transitions, 332 flow [2023-11-26 11:44:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-11-26 11:44:51,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9013806706114399 [2023-11-26 11:44:51,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-11-26 11:44:51,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-11-26 11:44:51,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:51,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-11-26 11:44:51,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,304 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 310 flow. Second operand 3 states and 457 transitions. [2023-11-26 11:44:51,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 150 transitions, 332 flow [2023-11-26 11:44:51,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 150 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:51,315 INFO L231 Difference]: Finished difference. Result has 152 places, 150 transitions, 308 flow [2023-11-26 11:44:51,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=152, PETRI_TRANSITIONS=150} [2023-11-26 11:44:51,316 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -12 predicate places. [2023-11-26 11:44:51,317 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 150 transitions, 308 flow [2023-11-26 11:44:51,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:51,319 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] [2023-11-26 11:44:51,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:44:51,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-11-26 11:44:51,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:51,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1691808634, now seen corresponding path program 1 times [2023-11-26 11:44:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704704398] [2023-11-26 11:44:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704704398] [2023-11-26 11:44:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704704398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:51,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299405495] [2023-11-26 11:44:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:51,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:51,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:51,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:51,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2023-11-26 11:44:51,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 150 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:51,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2023-11-26 11:44:51,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:51,605 INFO L124 PetriNetUnfolderBase]: 3/150 cut-off events. [2023-11-26 11:44:51,606 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:44:51,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 150 events. 3/150 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 129. Up to 11 conditions per place. [2023-11-26 11:44:51,607 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 11 selfloop transitions, 1 changer transitions 0/146 dead transitions. [2023-11-26 11:44:51,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 324 flow [2023-11-26 11:44:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-11-26 11:44:51,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8954635108481263 [2023-11-26 11:44:51,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-11-26 11:44:51,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-11-26 11:44:51,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:51,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-11-26 11:44:51,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,618 INFO L175 Difference]: Start difference. First operand has 152 places, 150 transitions, 308 flow. Second operand 3 states and 454 transitions. [2023-11-26 11:44:51,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 324 flow [2023-11-26 11:44:51,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 146 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:51,626 INFO L231 Difference]: Finished difference. Result has 148 places, 146 transitions, 298 flow [2023-11-26 11:44:51,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=148, PETRI_TRANSITIONS=146} [2023-11-26 11:44:51,629 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -16 predicate places. [2023-11-26 11:44:51,629 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 146 transitions, 298 flow [2023-11-26 11:44:51,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:51,630 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] [2023-11-26 11:44:51,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:44:51,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-11-26 11:44:51,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1446192789, now seen corresponding path program 1 times [2023-11-26 11:44:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497850130] [2023-11-26 11:44:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497850130] [2023-11-26 11:44:51,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497850130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219013103] [2023-11-26 11:44:51,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:51,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:51,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 169 [2023-11-26 11:44:51,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:51,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 169 [2023-11-26 11:44:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:51,792 INFO L124 PetriNetUnfolderBase]: 3/149 cut-off events. [2023-11-26 11:44:51,793 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:44:51,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 149 events. 3/149 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 126. Up to 10 conditions per place. [2023-11-26 11:44:51,794 INFO L140 encePairwiseOnDemand]: 166/169 looper letters, 9 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2023-11-26 11:44:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 318 flow [2023-11-26 11:44:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-11-26 11:44:51,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9053254437869822 [2023-11-26 11:44:51,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-11-26 11:44:51,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-11-26 11:44:51,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:51,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-11-26 11:44:51,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,805 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 298 flow. Second operand 3 states and 459 transitions. [2023-11-26 11:44:51,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 318 flow [2023-11-26 11:44:51,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 317 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:44:51,810 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 299 flow [2023-11-26 11:44:51,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2023-11-26 11:44:51,812 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -16 predicate places. [2023-11-26 11:44:51,812 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 299 flow [2023-11-26 11:44:51,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:51,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:51,814 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-26 11:44:51,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:44:51,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-11-26 11:44:51,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -942760572, now seen corresponding path program 1 times [2023-11-26 11:44:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:51,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911345739] [2023-11-26 11:44:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:52,009 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-26 11:44:52,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:52,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911345739] [2023-11-26 11:44:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911345739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:52,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:52,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:44:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205424606] [2023-11-26 11:44:52,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:52,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:44:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:44:52,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:44:52,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 169 [2023-11-26 11:44:52,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 147.2) internal successors, (736), 5 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:52,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 169 [2023-11-26 11:44:52,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:52,141 INFO L124 PetriNetUnfolderBase]: 2/152 cut-off events. [2023-11-26 11:44:52,142 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-26 11:44:52,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 152 events. 2/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 1/139 useless extension candidates. Maximal degree in co-relation 138. Up to 15 conditions per place. [2023-11-26 11:44:52,144 INFO L140 encePairwiseOnDemand]: 165/169 looper letters, 14 selfloop transitions, 0 changer transitions 4/148 dead transitions. [2023-11-26 11:44:52,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 341 flow [2023-11-26 11:44:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:44:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:44:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2023-11-26 11:44:52,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8804733727810651 [2023-11-26 11:44:52,149 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2023-11-26 11:44:52,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2023-11-26 11:44:52,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:52,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2023-11-26 11:44:52,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,160 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 299 flow. Second operand 5 states and 744 transitions. [2023-11-26 11:44:52,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 341 flow [2023-11-26 11:44:52,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 148 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:52,166 INFO L231 Difference]: Finished difference. Result has 153 places, 144 transitions, 299 flow [2023-11-26 11:44:52,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=153, PETRI_TRANSITIONS=144} [2023-11-26 11:44:52,168 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -11 predicate places. [2023-11-26 11:44:52,168 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 144 transitions, 299 flow [2023-11-26 11:44:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.2) internal successors, (736), 5 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:52,170 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, 1, 1, 1] [2023-11-26 11:44:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:44:52,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2023-11-26 11:44:52,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash 542710197, now seen corresponding path program 1 times [2023-11-26 11:44:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602097770] [2023-11-26 11:44:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:52,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:52,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:52,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:44:52,275 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2023-11-26 11:44:52,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2023-11-26 11:44:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2023-11-26 11:44:52,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2023-11-26 11:44:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2023-11-26 11:44:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2023-11-26 11:44:52,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2023-11-26 11:44:52,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2023-11-26 11:44:52,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2023-11-26 11:44:52,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2023-11-26 11:44:52,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2023-11-26 11:44:52,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2023-11-26 11:44:52,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2023-11-26 11:44:52,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2023-11-26 11:44:52,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2023-11-26 11:44:52,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2023-11-26 11:44:52,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2023-11-26 11:44:52,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2023-11-26 11:44:52,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2023-11-26 11:44:52,283 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2023-11-26 11:44:52,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2023-11-26 11:44:52,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2023-11-26 11:44:52,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2023-11-26 11:44:52,284 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2023-11-26 11:44:52,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2023-11-26 11:44:52,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2023-11-26 11:44:52,285 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2023-11-26 11:44:52,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2023-11-26 11:44:52,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2023-11-26 11:44:52,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:44:52,286 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 11:44:52,290 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:44:52,290 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-26 11:44:52,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:44:52,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 522 flow [2023-11-26 11:44:52,452 INFO L124 PetriNetUnfolderBase]: 15/284 cut-off events. [2023-11-26 11:44:52,452 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:44:52,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 284 events. 15/284 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 549 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 187. Up to 6 conditions per place. [2023-11-26 11:44:52,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 522 flow [2023-11-26 11:44:52,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 256 transitions, 522 flow [2023-11-26 11:44:52,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:44:52,466 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;@463fdd9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:44:52,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2023-11-26 11:44:52,470 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:44:52,470 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 11:44:52,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:44:52,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:52,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:52,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:52,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1528358272, now seen corresponding path program 1 times [2023-11-26 11:44:52,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686435541] [2023-11-26 11:44:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686435541] [2023-11-26 11:44:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686435541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599431334] [2023-11-26 11:44:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:52,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:52,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 256 [2023-11-26 11:44:52,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 256 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:52,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 256 [2023-11-26 11:44:52,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:52,782 INFO L124 PetriNetUnfolderBase]: 61/810 cut-off events. [2023-11-26 11:44:52,782 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-26 11:44:52,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 810 events. 61/810 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4585 event pairs, 42 based on Foata normal form. 91/768 useless extension candidates. Maximal degree in co-relation 736. Up to 102 conditions per place. [2023-11-26 11:44:52,796 INFO L140 encePairwiseOnDemand]: 244/256 looper letters, 17 selfloop transitions, 2 changer transitions 1/233 dead transitions. [2023-11-26 11:44:52,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 514 flow [2023-11-26 11:44:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2023-11-26 11:44:52,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9127604166666666 [2023-11-26 11:44:52,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 701 transitions. [2023-11-26 11:44:52,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions. [2023-11-26 11:44:52,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:52,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions. [2023-11-26 11:44:52,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,810 INFO L175 Difference]: Start difference. First operand has 248 places, 256 transitions, 522 flow. Second operand 3 states and 701 transitions. [2023-11-26 11:44:52,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 514 flow [2023-11-26 11:44:52,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 233 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:44:52,819 INFO L231 Difference]: Finished difference. Result has 235 places, 232 transitions, 478 flow [2023-11-26 11:44:52,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=235, PETRI_TRANSITIONS=232} [2023-11-26 11:44:52,821 INFO L281 CegarLoopForPetriNet]: 248 programPoint places, -13 predicate places. [2023-11-26 11:44:52,821 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 232 transitions, 478 flow [2023-11-26 11:44:52,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:52,823 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] [2023-11-26 11:44:52,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:44:52,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:52,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 101920056, now seen corresponding path program 1 times [2023-11-26 11:44:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393818972] [2023-11-26 11:44:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393818972] [2023-11-26 11:44:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393818972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:52,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472744992] [2023-11-26 11:44:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:52,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:52,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:52,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:52,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 256 [2023-11-26 11:44:52,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 232 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:52,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:52,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 256 [2023-11-26 11:44:52,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:53,081 INFO L124 PetriNetUnfolderBase]: 25/553 cut-off events. [2023-11-26 11:44:53,081 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-26 11:44:53,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 553 events. 25/553 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2458 event pairs, 12 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 580. Up to 39 conditions per place. [2023-11-26 11:44:53,090 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 14 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2023-11-26 11:44:53,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 231 transitions, 508 flow [2023-11-26 11:44:53,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2023-11-26 11:44:53,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9088541666666666 [2023-11-26 11:44:53,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2023-11-26 11:44:53,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2023-11-26 11:44:53,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:53,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2023-11-26 11:44:53,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,102 INFO L175 Difference]: Start difference. First operand has 235 places, 232 transitions, 478 flow. Second operand 3 states and 698 transitions. [2023-11-26 11:44:53,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 231 transitions, 508 flow [2023-11-26 11:44:53,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 231 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:53,110 INFO L231 Difference]: Finished difference. Result has 233 places, 231 transitions, 476 flow [2023-11-26 11:44:53,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=231} [2023-11-26 11:44:53,112 INFO L281 CegarLoopForPetriNet]: 248 programPoint places, -15 predicate places. [2023-11-26 11:44:53,113 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 231 transitions, 476 flow [2023-11-26 11:44:53,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:53,114 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] [2023-11-26 11:44:53,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:44:53,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:53,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1122192518, now seen corresponding path program 1 times [2023-11-26 11:44:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:53,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177598883] [2023-11-26 11:44:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177598883] [2023-11-26 11:44:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177598883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665432843] [2023-11-26 11:44:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:53,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:53,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:53,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 256 [2023-11-26 11:44:53,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 231 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:53,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 256 [2023-11-26 11:44:53,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:53,410 INFO L124 PetriNetUnfolderBase]: 39/750 cut-off events. [2023-11-26 11:44:53,411 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:44:53,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 750 events. 39/750 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4169 event pairs, 20 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 789. Up to 56 conditions per place. [2023-11-26 11:44:53,420 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 16 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2023-11-26 11:44:53,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 500 flow [2023-11-26 11:44:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-11-26 11:44:53,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8997395833333334 [2023-11-26 11:44:53,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-11-26 11:44:53,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-11-26 11:44:53,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:53,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-11-26 11:44:53,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,431 INFO L175 Difference]: Start difference. First operand has 233 places, 231 transitions, 476 flow. Second operand 3 states and 691 transitions. [2023-11-26 11:44:53,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 500 flow [2023-11-26 11:44:53,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:53,438 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 464 flow [2023-11-26 11:44:53,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2023-11-26 11:44:53,441 INFO L281 CegarLoopForPetriNet]: 248 programPoint places, -20 predicate places. [2023-11-26 11:44:53,441 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 464 flow [2023-11-26 11:44:53,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:53,444 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] [2023-11-26 11:44:53,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:44:53,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:53,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1049519765, now seen corresponding path program 1 times [2023-11-26 11:44:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:53,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30149802] [2023-11-26 11:44:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:53,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30149802] [2023-11-26 11:44:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30149802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:53,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747032552] [2023-11-26 11:44:53,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:53,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:53,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:53,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:53,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 256 [2023-11-26 11:44:53,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:53,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 256 [2023-11-26 11:44:53,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:53,705 INFO L124 PetriNetUnfolderBase]: 47/709 cut-off events. [2023-11-26 11:44:53,705 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 11:44:53,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 709 events. 47/709 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3537 event pairs, 30 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 770. Up to 76 conditions per place. [2023-11-26 11:44:53,715 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 15 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2023-11-26 11:44:53,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 496 flow [2023-11-26 11:44:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2023-11-26 11:44:53,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.90625 [2023-11-26 11:44:53,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 696 transitions. [2023-11-26 11:44:53,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 696 transitions. [2023-11-26 11:44:53,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:53,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 696 transitions. [2023-11-26 11:44:53,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,727 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 464 flow. Second operand 3 states and 696 transitions. [2023-11-26 11:44:53,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 496 flow [2023-11-26 11:44:53,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 225 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:44:53,735 INFO L231 Difference]: Finished difference. Result has 228 places, 225 transitions, 465 flow [2023-11-26 11:44:53,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=465, PETRI_PLACES=228, PETRI_TRANSITIONS=225} [2023-11-26 11:44:53,737 INFO L281 CegarLoopForPetriNet]: 248 programPoint places, -20 predicate places. [2023-11-26 11:44:53,737 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 225 transitions, 465 flow [2023-11-26 11:44:53,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:53,739 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] [2023-11-26 11:44:53,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:44:53,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:53,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1572904046, now seen corresponding path program 1 times [2023-11-26 11:44:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:53,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102532785] [2023-11-26 11:44:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:53,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102532785] [2023-11-26 11:44:53,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102532785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:53,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:53,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403289935] [2023-11-26 11:44:53,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:53,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:53,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:53,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 256 [2023-11-26 11:44:53,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 225 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:53,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:53,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 256 [2023-11-26 11:44:53,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:54,365 INFO L124 PetriNetUnfolderBase]: 164/2096 cut-off events. [2023-11-26 11:44:54,366 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-26 11:44:54,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 2096 events. 164/2096 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17302 event pairs, 57 based on Foata normal form. 0/1792 useless extension candidates. Maximal degree in co-relation 2384. Up to 204 conditions per place. [2023-11-26 11:44:54,396 INFO L140 encePairwiseOnDemand]: 236/256 looper letters, 32 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2023-11-26 11:44:54,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 244 transitions, 600 flow [2023-11-26 11:44:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2023-11-26 11:44:54,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9192708333333334 [2023-11-26 11:44:54,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 706 transitions. [2023-11-26 11:44:54,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 706 transitions. [2023-11-26 11:44:54,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:54,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 706 transitions. [2023-11-26 11:44:54,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:54,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:54,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:54,411 INFO L175 Difference]: Start difference. First operand has 228 places, 225 transitions, 465 flow. Second operand 3 states and 706 transitions. [2023-11-26 11:44:54,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 244 transitions, 600 flow [2023-11-26 11:44:54,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 244 transitions, 596 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:54,421 INFO L231 Difference]: Finished difference. Result has 230 places, 239 transitions, 585 flow [2023-11-26 11:44:54,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=230, PETRI_TRANSITIONS=239} [2023-11-26 11:44:54,424 INFO L281 CegarLoopForPetriNet]: 248 programPoint places, -18 predicate places. [2023-11-26 11:44:54,424 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 239 transitions, 585 flow [2023-11-26 11:44:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:54,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:54,425 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-26 11:44:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:44:54,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:54,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1292272724, now seen corresponding path program 1 times [2023-11-26 11:44:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438030679] [2023-11-26 11:44:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:54,635 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-26 11:44:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438030679] [2023-11-26 11:44:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438030679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:54,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:54,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:44:54,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502313222] [2023-11-26 11:44:54,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:54,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:44:54,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:54,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:44:54,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:44:54,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 256 [2023-11-26 11:44:54,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 239 transitions, 585 flow. Second operand has 5 states, 5 states have (on average 227.4) internal successors, (1137), 5 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:54,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:54,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 256 [2023-11-26 11:44:54,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:55,128 INFO L124 PetriNetUnfolderBase]: 99/1993 cut-off events. [2023-11-26 11:44:55,128 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-26 11:44:55,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1993 events. 99/1993 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 16329 event pairs, 41 based on Foata normal form. 1/1705 useless extension candidates. Maximal degree in co-relation 2223. Up to 120 conditions per place. [2023-11-26 11:44:55,152 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 17 selfloop transitions, 0 changer transitions 4/242 dead transitions. [2023-11-26 11:44:55,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 242 transitions, 633 flow [2023-11-26 11:44:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:44:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:44:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1147 transitions. [2023-11-26 11:44:55,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.89609375 [2023-11-26 11:44:55,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1147 transitions. [2023-11-26 11:44:55,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1147 transitions. [2023-11-26 11:44:55,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:55,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1147 transitions. [2023-11-26 11:44:55,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.4) internal successors, (1147), 5 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:55,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:55,166 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:55,167 INFO L175 Difference]: Start difference. First operand has 230 places, 239 transitions, 585 flow. Second operand 5 states and 1147 transitions. [2023-11-26 11:44:55,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 242 transitions, 633 flow [2023-11-26 11:44:55,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 242 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:55,176 INFO L231 Difference]: Finished difference. Result has 235 places, 238 transitions, 561 flow [2023-11-26 11:44:55,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=235, PETRI_TRANSITIONS=238} [2023-11-26 11:44:55,178 INFO L281 CegarLoopForPetriNet]: 248 programPoint places, -13 predicate places. [2023-11-26 11:44:55,178 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 238 transitions, 561 flow [2023-11-26 11:44:55,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 227.4) internal successors, (1137), 5 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:55,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:55,179 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, 1, 1, 1] [2023-11-26 11:44:55,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:44:55,180 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-26 11:44:55,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1252633253, now seen corresponding path program 1 times [2023-11-26 11:44:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:55,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162717769] [2023-11-26 11:44:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:55,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:44:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:44:55,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:44:55,238 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:44:55,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2023-11-26 11:44:55,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2023-11-26 11:44:55,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2023-11-26 11:44:55,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2023-11-26 11:44:55,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2023-11-26 11:44:55,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2023-11-26 11:44:55,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2023-11-26 11:44:55,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2023-11-26 11:44:55,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2023-11-26 11:44:55,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2023-11-26 11:44:55,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2023-11-26 11:44:55,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2023-11-26 11:44:55,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2023-11-26 11:44:55,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2023-11-26 11:44:55,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2023-11-26 11:44:55,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2023-11-26 11:44:55,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2023-11-26 11:44:55,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2023-11-26 11:44:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2023-11-26 11:44:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2023-11-26 11:44:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2023-11-26 11:44:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2023-11-26 11:44:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2023-11-26 11:44:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2023-11-26 11:44:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2023-11-26 11:44:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2023-11-26 11:44:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2023-11-26 11:44:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2023-11-26 11:44:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2023-11-26 11:44:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2023-11-26 11:44:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2023-11-26 11:44:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2023-11-26 11:44:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2023-11-26 11:44:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2023-11-26 11:44:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2023-11-26 11:44:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2023-11-26 11:44:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2023-11-26 11:44:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2023-11-26 11:44:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2023-11-26 11:44:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2023-11-26 11:44:55,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:44:55,248 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:55,248 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:44:55,248 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-26 11:44:55,319 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:44:55,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 343 transitions, 704 flow [2023-11-26 11:44:55,410 INFO L124 PetriNetUnfolderBase]: 21/386 cut-off events. [2023-11-26 11:44:55,410 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 11:44:55,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 386 events. 21/386 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1073 event pairs, 0 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 288. Up to 8 conditions per place. [2023-11-26 11:44:55,418 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 343 transitions, 704 flow [2023-11-26 11:44:55,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 332 places, 343 transitions, 704 flow [2023-11-26 11:44:55,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:44:55,426 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;@463fdd9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:44:55,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-11-26 11:44:55,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:44:55,429 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 11:44:55,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:44:55,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:55,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:44:55,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:44:55,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1260116311, now seen corresponding path program 1 times [2023-11-26 11:44:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019331751] [2023-11-26 11:44:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019331751] [2023-11-26 11:44:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019331751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:55,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950252048] [2023-11-26 11:44:55,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:55,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 343 [2023-11-26 11:44:55,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 343 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:55,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:55,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 343 [2023-11-26 11:44:55,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:56,886 INFO L124 PetriNetUnfolderBase]: 763/5685 cut-off events. [2023-11-26 11:44:56,887 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2023-11-26 11:44:56,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6943 conditions, 5685 events. 763/5685 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 60052 event pairs, 630 based on Foata normal form. 701/5455 useless extension candidates. Maximal degree in co-relation 5718. Up to 1033 conditions per place. [2023-11-26 11:44:56,993 INFO L140 encePairwiseOnDemand]: 328/343 looper letters, 24 selfloop transitions, 2 changer transitions 1/314 dead transitions. [2023-11-26 11:44:56,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 314 transitions, 698 flow [2023-11-26 11:44:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2023-11-26 11:44:56,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9125364431486881 [2023-11-26 11:44:56,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2023-11-26 11:44:56,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2023-11-26 11:44:56,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:56,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2023-11-26 11:44:57,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,006 INFO L175 Difference]: Start difference. First operand has 332 places, 343 transitions, 704 flow. Second operand 3 states and 939 transitions. [2023-11-26 11:44:57,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 314 transitions, 698 flow [2023-11-26 11:44:57,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 314 transitions, 696 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-26 11:44:57,016 INFO L231 Difference]: Finished difference. Result has 316 places, 313 transitions, 646 flow [2023-11-26 11:44:57,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=316, PETRI_TRANSITIONS=313} [2023-11-26 11:44:57,018 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -16 predicate places. [2023-11-26 11:44:57,018 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 313 transitions, 646 flow [2023-11-26 11:44:57,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:57,019 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] [2023-11-26 11:44:57,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:44:57,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:44:57,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1477679928, now seen corresponding path program 1 times [2023-11-26 11:44:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934641740] [2023-11-26 11:44:57,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:57,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934641740] [2023-11-26 11:44:57,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934641740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:57,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:57,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:57,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252119387] [2023-11-26 11:44:57,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:57,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:57,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:57,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 343 [2023-11-26 11:44:57,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 313 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:57,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 343 [2023-11-26 11:44:57,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:57,658 INFO L124 PetriNetUnfolderBase]: 163/2236 cut-off events. [2023-11-26 11:44:57,659 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2023-11-26 11:44:57,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 2236 events. 163/2236 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 18969 event pairs, 108 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2471. Up to 199 conditions per place. [2023-11-26 11:44:57,705 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 18 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2023-11-26 11:44:57,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 312 transitions, 684 flow [2023-11-26 11:44:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2023-11-26 11:44:57,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9125364431486881 [2023-11-26 11:44:57,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2023-11-26 11:44:57,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2023-11-26 11:44:57,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:57,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2023-11-26 11:44:57,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,719 INFO L175 Difference]: Start difference. First operand has 316 places, 313 transitions, 646 flow. Second operand 3 states and 939 transitions. [2023-11-26 11:44:57,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 312 transitions, 684 flow [2023-11-26 11:44:57,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 312 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:57,729 INFO L231 Difference]: Finished difference. Result has 314 places, 312 transitions, 644 flow [2023-11-26 11:44:57,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=314, PETRI_TRANSITIONS=312} [2023-11-26 11:44:57,731 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -18 predicate places. [2023-11-26 11:44:57,731 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 312 transitions, 644 flow [2023-11-26 11:44:57,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:57,732 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] [2023-11-26 11:44:57,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:44:57,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:44:57,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1549936570, now seen corresponding path program 1 times [2023-11-26 11:44:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417268506] [2023-11-26 11:44:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417268506] [2023-11-26 11:44:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417268506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:57,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701858745] [2023-11-26 11:44:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:57,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 343 [2023-11-26 11:44:57,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 312 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:57,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:57,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 343 [2023-11-26 11:44:57,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:58,635 INFO L124 PetriNetUnfolderBase]: 325/4000 cut-off events. [2023-11-26 11:44:58,635 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-26 11:44:58,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4000 events. 325/4000 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40864 event pairs, 220 based on Foata normal form. 0/3343 useless extension candidates. Maximal degree in co-relation 4439. Up to 381 conditions per place. [2023-11-26 11:44:58,701 INFO L140 encePairwiseOnDemand]: 336/343 looper letters, 21 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2023-11-26 11:44:58,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 306 transitions, 676 flow [2023-11-26 11:44:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2023-11-26 11:44:58,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.901846452866861 [2023-11-26 11:44:58,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 928 transitions. [2023-11-26 11:44:58,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 928 transitions. [2023-11-26 11:44:58,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:58,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 928 transitions. [2023-11-26 11:44:58,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:58,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:58,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:58,713 INFO L175 Difference]: Start difference. First operand has 314 places, 312 transitions, 644 flow. Second operand 3 states and 928 transitions. [2023-11-26 11:44:58,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 306 transitions, 676 flow [2023-11-26 11:44:58,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 306 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:44:58,721 INFO L231 Difference]: Finished difference. Result has 308 places, 306 transitions, 630 flow [2023-11-26 11:44:58,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=308, PETRI_TRANSITIONS=306} [2023-11-26 11:44:58,723 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -24 predicate places. [2023-11-26 11:44:58,723 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 306 transitions, 630 flow [2023-11-26 11:44:58,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:58,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:58,724 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] [2023-11-26 11:44:58,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:44:58,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:44:58,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1495226027, now seen corresponding path program 1 times [2023-11-26 11:44:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101206378] [2023-11-26 11:44:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:58,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101206378] [2023-11-26 11:44:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101206378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:58,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818984408] [2023-11-26 11:44:58,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:58,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:58,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:58,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:58,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 343 [2023-11-26 11:44:58,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 306 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:58,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:58,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 343 [2023-11-26 11:44:58,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:44:59,684 INFO L124 PetriNetUnfolderBase]: 493/4263 cut-off events. [2023-11-26 11:44:59,684 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-26 11:44:59,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 4263 events. 493/4263 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 41000 event pairs, 390 based on Foata normal form. 0/3578 useless extension candidates. Maximal degree in co-relation 5008. Up to 652 conditions per place. [2023-11-26 11:44:59,824 INFO L140 encePairwiseOnDemand]: 340/343 looper letters, 21 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2023-11-26 11:44:59,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 674 flow [2023-11-26 11:44:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:44:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:44:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2023-11-26 11:44:59,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9067055393586005 [2023-11-26 11:44:59,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 933 transitions. [2023-11-26 11:44:59,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 933 transitions. [2023-11-26 11:44:59,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:44:59,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 933 transitions. [2023-11-26 11:44:59,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:44:59,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:59,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:59,836 INFO L175 Difference]: Start difference. First operand has 308 places, 306 transitions, 630 flow. Second operand 3 states and 933 transitions. [2023-11-26 11:44:59,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 674 flow [2023-11-26 11:44:59,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 305 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:44:59,846 INFO L231 Difference]: Finished difference. Result has 308 places, 305 transitions, 631 flow [2023-11-26 11:44:59,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=308, PETRI_TRANSITIONS=305} [2023-11-26 11:44:59,848 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -24 predicate places. [2023-11-26 11:44:59,848 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 305 transitions, 631 flow [2023-11-26 11:44:59,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:59,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:44:59,849 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] [2023-11-26 11:44:59,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:44:59,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:44:59,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:44:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash 745095490, now seen corresponding path program 1 times [2023-11-26 11:44:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:44:59,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060169828] [2023-11-26 11:44:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:44:59,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:44:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:44:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:44:59,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:44:59,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060169828] [2023-11-26 11:44:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060169828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:44:59,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:44:59,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:44:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606389178] [2023-11-26 11:44:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:44:59,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:44:59,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:44:59,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:44:59,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:44:59,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 343 [2023-11-26 11:44:59,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 305 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:44:59,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:44:59,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 343 [2023-11-26 11:44:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:05,520 INFO L124 PetriNetUnfolderBase]: 4201/31332 cut-off events. [2023-11-26 11:45:05,520 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-11-26 11:45:05,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37791 conditions, 31332 events. 4201/31332 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 462534 event pairs, 1667 based on Foata normal form. 0/26532 useless extension candidates. Maximal degree in co-relation 37748. Up to 4132 conditions per place. [2023-11-26 11:45:05,880 INFO L140 encePairwiseOnDemand]: 313/343 looper letters, 48 selfloop transitions, 21 changer transitions 0/334 dead transitions. [2023-11-26 11:45:05,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 334 transitions, 837 flow [2023-11-26 11:45:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2023-11-26 11:45:05,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9154518950437318 [2023-11-26 11:45:05,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2023-11-26 11:45:05,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2023-11-26 11:45:05,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:05,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2023-11-26 11:45:05,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 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-26 11:45:05,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:05,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 343.0) internal successors, (1372), 4 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:05,893 INFO L175 Difference]: Start difference. First operand has 308 places, 305 transitions, 631 flow. Second operand 3 states and 942 transitions. [2023-11-26 11:45:05,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 334 transitions, 837 flow [2023-11-26 11:45:05,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 334 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:05,902 INFO L231 Difference]: Finished difference. Result has 310 places, 326 transitions, 813 flow [2023-11-26 11:45:05,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=310, PETRI_TRANSITIONS=326} [2023-11-26 11:45:05,904 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -22 predicate places. [2023-11-26 11:45:05,904 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 326 transitions, 813 flow [2023-11-26 11:45:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:05,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:05,905 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] [2023-11-26 11:45:05,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:45:05,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:45:05,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2013112243, now seen corresponding path program 1 times [2023-11-26 11:45:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634168441] [2023-11-26 11:45:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:45:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634168441] [2023-11-26 11:45:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634168441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:06,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:45:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32817953] [2023-11-26 11:45:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:06,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:45:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:06,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:45:06,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:45:06,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 343 [2023-11-26 11:45:06,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 326 transitions, 813 flow. Second operand 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-26 11:45:06,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:06,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 343 [2023-11-26 11:45:06,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:08,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][118], [353#(= |#race~next~0| 0), 112#L1043-3true, Black: 351#true, 157#L1045-2true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 345#(= |#race~len~0| 0), 357#true, 275#L1045-2true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:08,319 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-26 11:45:08,319 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-26 11:45:08,319 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:08,319 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, thrThread3of3ForFork0_#t~nondet6#1=|v_thrThread3of3ForFork0_#t~nondet6#1_1|, ~#lock~0.base=|v_~#lock~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~nondet6#1][182], [Black: 353#(= |#race~next~0| 0), 157#L1045-2true, 351#true, thrThread1of3ForFork0InUse, 360#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 345#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 275#L1045-2true, 246#L1045-2true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:09,071 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-26 11:45:09,071 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-26 11:45:09,071 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-26 11:45:09,071 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-26 11:45:09,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][118], [Black: 353#(= |#race~next~0| 0), 157#L1045-2true, 351#true, thrThread1of3ForFork0InUse, 345#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 357#true, 275#L1045-2true, 273#L1043true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:09,122 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-26 11:45:09,122 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:45:09,123 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:45:09,123 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-26 11:45:09,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][118], [289#L1043-1true, Black: 353#(= |#race~next~0| 0), 157#L1045-2true, 351#true, thrThread1of3ForFork0InUse, 357#true, 345#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 275#L1045-2true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:09,311 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:45:09,311 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:45:09,311 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:45:09,311 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:45:09,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][118], [Black: 353#(= |#race~next~0| 0), 157#L1045-2true, 351#true, thrThread1of3ForFork0InUse, 345#(= |#race~len~0| 0), 357#true, thrThread2of3ForFork0InUse, 275#L1045-2true, 219#L1043-2true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:09,410 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-26 11:45:09,410 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 11:45:09,410 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 11:45:09,410 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-26 11:45:09,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][118], [112#L1043-3true, Black: 353#(= |#race~next~0| 0), 157#L1045-2true, 351#true, thrThread1of3ForFork0InUse, 345#(= |#race~len~0| 0), 357#true, thrThread2of3ForFork0InUse, 275#L1045-2true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:09,411 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-26 11:45:09,411 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,411 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,411 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,632 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][118], [112#L1043-3true, Black: 353#(= |#race~next~0| 0), 157#L1045-2true, 351#true, thrThread1of3ForFork0InUse, thrThread2of3ForFork0InUse, 345#(= |#race~len~0| 0), 357#true, 275#L1045-2true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:09,632 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-26 11:45:09,633 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,633 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,633 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-26 11:45:09,633 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-26 11:45:11,902 INFO L124 PetriNetUnfolderBase]: 3328/34425 cut-off events. [2023-11-26 11:45:11,902 INFO L125 PetriNetUnfolderBase]: For 1017/1047 co-relation queries the response was YES. [2023-11-26 11:45:12,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41496 conditions, 34425 events. 3328/34425 cut-off events. For 1017/1047 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 529748 event pairs, 1485 based on Foata normal form. 59/29499 useless extension candidates. Maximal degree in co-relation 41453. Up to 2976 conditions per place. [2023-11-26 11:45:12,337 INFO L140 encePairwiseOnDemand]: 339/343 looper letters, 27 selfloop transitions, 3 changer transitions 0/339 dead transitions. [2023-11-26 11:45:12,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 339 transitions, 919 flow [2023-11-26 11:45:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:45:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:45:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1275 transitions. [2023-11-26 11:45:12,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9293002915451894 [2023-11-26 11:45:12,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1275 transitions. [2023-11-26 11:45:12,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1275 transitions. [2023-11-26 11:45:12,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:12,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1275 transitions. [2023-11-26 11:45:12,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 318.75) internal successors, (1275), 4 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:12,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:12,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 343.0) internal successors, (1715), 5 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:12,355 INFO L175 Difference]: Start difference. First operand has 310 places, 326 transitions, 813 flow. Second operand 4 states and 1275 transitions. [2023-11-26 11:45:12,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 339 transitions, 919 flow [2023-11-26 11:45:12,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 339 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:12,398 INFO L231 Difference]: Finished difference. Result has 312 places, 326 transitions, 781 flow [2023-11-26 11:45:12,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=781, PETRI_PLACES=312, PETRI_TRANSITIONS=326} [2023-11-26 11:45:12,399 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -20 predicate places. [2023-11-26 11:45:12,399 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 326 transitions, 781 flow [2023-11-26 11:45:12,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-26 11:45:12,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:12,400 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-26 11:45:12,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:45:12,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:45:12,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash -837422557, now seen corresponding path program 1 times [2023-11-26 11:45:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:12,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849150719] [2023-11-26 11:45:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:12,497 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-26 11:45:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849150719] [2023-11-26 11:45:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849150719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:45:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278511504] [2023-11-26 11:45:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:12,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:45:12,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:12,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:45:12,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:45:12,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 343 [2023-11-26 11:45:12,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 326 transitions, 781 flow. Second operand has 5 states, 5 states have (on average 307.6) internal successors, (1538), 5 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:12,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:12,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 343 [2023-11-26 11:45:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:14,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1087] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread3of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, thrThread3of3ForFork0_#t~nondet6#1=|v_thrThread3of3ForFork0_#t~nondet6#1_1|, ~#lock~0.base=|v_~#lock~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~nondet6#1][149], [Black: 351#true, 157#L1045-2true, thrThread1of3ForFork0InUse, Black: 360#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), thrThread2of3ForFork0InUse, 357#true, 345#(= |#race~len~0| 0), 275#L1045-2true, thrThread3of3ForFork0InUse, 363#true, 295#L1043-6true, 94#L1061-4true]) [2023-11-26 11:45:14,786 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2023-11-26 11:45:14,786 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:45:14,786 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-26 11:45:14,787 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-26 11:45:14,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1173] L1041-6-->L1045-2: Formula: (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|) |v_~#lock~0.offset_11| 0))) (= |v_thrThread2of3ForFork0_#t~nondet6#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread2of3ForFork0_#t~nondet6#1=|v_thrThread2of3ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~nondet6#1][115], [Black: 353#(= |#race~next~0| 0), 157#L1045-2true, thrThread1of3ForFork0InUse, 360#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 345#(= |#race~len~0| 0), thrThread2of3ForFork0InUse, 246#L1045-2true, 275#L1045-2true, 363#true, thrThread3of3ForFork0InUse, 94#L1061-4true]) [2023-11-26 11:45:14,891 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-26 11:45:14,891 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:45:14,891 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:45:14,891 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-26 11:45:17,044 INFO L124 PetriNetUnfolderBase]: 2233/24093 cut-off events. [2023-11-26 11:45:17,045 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-11-26 11:45:17,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28138 conditions, 24093 events. 2233/24093 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 353990 event pairs, 1151 based on Foata normal form. 1/20432 useless extension candidates. Maximal degree in co-relation 28093. Up to 2300 conditions per place. [2023-11-26 11:45:17,423 INFO L140 encePairwiseOnDemand]: 339/343 looper letters, 20 selfloop transitions, 0 changer transitions 4/329 dead transitions. [2023-11-26 11:45:17,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 329 transitions, 835 flow [2023-11-26 11:45:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:45:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:45:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1550 transitions. [2023-11-26 11:45:17,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9037900874635568 [2023-11-26 11:45:17,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1550 transitions. [2023-11-26 11:45:17,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1550 transitions. [2023-11-26 11:45:17,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:17,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1550 transitions. [2023-11-26 11:45:17,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:17,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:17,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 343.0) internal successors, (2058), 6 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:17,440 INFO L175 Difference]: Start difference. First operand has 312 places, 326 transitions, 781 flow. Second operand 5 states and 1550 transitions. [2023-11-26 11:45:17,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 329 transitions, 835 flow [2023-11-26 11:45:17,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 329 transitions, 829 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:45:17,449 INFO L231 Difference]: Finished difference. Result has 316 places, 325 transitions, 779 flow [2023-11-26 11:45:17,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=343, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=779, PETRI_PLACES=316, PETRI_TRANSITIONS=325} [2023-11-26 11:45:17,450 INFO L281 CegarLoopForPetriNet]: 332 programPoint places, -16 predicate places. [2023-11-26 11:45:17,450 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 325 transitions, 779 flow [2023-11-26 11:45:17,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 307.6) internal successors, (1538), 5 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:17,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:17,451 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, 1, 1, 1] [2023-11-26 11:45:17,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:45:17,452 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:45:17,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1198051851, now seen corresponding path program 1 times [2023-11-26 11:45:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382986600] [2023-11-26 11:45:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:45:17,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:45:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:45:17,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:45:17,547 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:45:17,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2023-11-26 11:45:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-11-26 11:45:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-11-26 11:45:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-11-26 11:45:17,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-11-26 11:45:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-11-26 11:45:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-11-26 11:45:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-11-26 11:45:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-11-26 11:45:17,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-11-26 11:45:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-11-26 11:45:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-11-26 11:45:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-11-26 11:45:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-11-26 11:45:17,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-11-26 11:45:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-11-26 11:45:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-11-26 11:45:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-11-26 11:45:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-11-26 11:45:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-11-26 11:45:17,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-11-26 11:45:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-11-26 11:45:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-11-26 11:45:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-11-26 11:45:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-11-26 11:45:17,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-11-26 11:45:17,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-11-26 11:45:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-11-26 11:45:17,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-11-26 11:45:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-11-26 11:45:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2023-11-26 11:45:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2023-11-26 11:45:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2023-11-26 11:45:17,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2023-11-26 11:45:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2023-11-26 11:45:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-11-26 11:45:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-11-26 11:45:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-11-26 11:45:17,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-11-26 11:45:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-11-26 11:45:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-11-26 11:45:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-11-26 11:45:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-11-26 11:45:17,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-11-26 11:45:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-11-26 11:45:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-11-26 11:45:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-11-26 11:45:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-11-26 11:45:17,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-11-26 11:45:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-11-26 11:45:17,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-11-26 11:45:17,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:45:17,560 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:45:17,562 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-26 11:45:17,562 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-26 11:45:17,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:45:17,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 416 places, 430 transitions, 888 flow [2023-11-26 11:45:17,921 INFO L124 PetriNetUnfolderBase]: 27/488 cut-off events. [2023-11-26 11:45:17,922 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-26 11:45:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 488 events. 27/488 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1657 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 394. Up to 10 conditions per place. [2023-11-26 11:45:17,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 416 places, 430 transitions, 888 flow [2023-11-26 11:45:17,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 416 places, 430 transitions, 888 flow [2023-11-26 11:45:17,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:45:17,943 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;@463fdd9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:45:17,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-11-26 11:45:17,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:45:17,945 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2023-11-26 11:45:17,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:45:17,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:17,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:45:17,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2023-11-26 11:45:17,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:17,947 INFO L85 PathProgramCache]: Analyzing trace with hash 273077765, now seen corresponding path program 1 times [2023-11-26 11:45:17,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195074439] [2023-11-26 11:45:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:45:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:17,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195074439] [2023-11-26 11:45:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195074439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089312191] [2023-11-26 11:45:17,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:17,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:17,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:17,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:18,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 430 [2023-11-26 11:45:18,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 430 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:18,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:18,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 430 [2023-11-26 11:45:18,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:26,492 INFO L124 PetriNetUnfolderBase]: 7737/41871 cut-off events. [2023-11-26 11:45:26,493 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2023-11-26 11:45:27,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53420 conditions, 41871 events. 7737/41871 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 612069 event pairs, 6804 based on Foata normal form. 5588/40928 useless extension candidates. Maximal degree in co-relation 44090. Up to 9608 conditions per place. [2023-11-26 11:45:27,411 INFO L140 encePairwiseOnDemand]: 412/430 looper letters, 31 selfloop transitions, 2 changer transitions 1/395 dead transitions. [2023-11-26 11:45:27,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 395 transitions, 884 flow [2023-11-26 11:45:27,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2023-11-26 11:45:27,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9124031007751938 [2023-11-26 11:45:27,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1177 transitions. [2023-11-26 11:45:27,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1177 transitions. [2023-11-26 11:45:27,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:27,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1177 transitions. [2023-11-26 11:45:27,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:27,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:27,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:27,428 INFO L175 Difference]: Start difference. First operand has 416 places, 430 transitions, 888 flow. Second operand 3 states and 1177 transitions. [2023-11-26 11:45:27,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 395 transitions, 884 flow [2023-11-26 11:45:27,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 395 transitions, 878 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-26 11:45:27,440 INFO L231 Difference]: Finished difference. Result has 397 places, 394 transitions, 814 flow [2023-11-26 11:45:27,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=397, PETRI_TRANSITIONS=394} [2023-11-26 11:45:27,441 INFO L281 CegarLoopForPetriNet]: 416 programPoint places, -19 predicate places. [2023-11-26 11:45:27,442 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 394 transitions, 814 flow [2023-11-26 11:45:27,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.3333333333333) internal successors, (1132), 3 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:27,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:27,443 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] [2023-11-26 11:45:27,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 11:45:27,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2023-11-26 11:45:27,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1674737464, now seen corresponding path program 1 times [2023-11-26 11:45:27,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:27,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420394262] [2023-11-26 11:45:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:45:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420394262] [2023-11-26 11:45:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420394262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129972147] [2023-11-26 11:45:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:27,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:27,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:27,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 430 [2023-11-26 11:45:27,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 394 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:27,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:27,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 430 [2023-11-26 11:45:27,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:29,653 INFO L124 PetriNetUnfolderBase]: 909/9199 cut-off events. [2023-11-26 11:45:29,653 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2023-11-26 11:45:29,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10494 conditions, 9199 events. 909/9199 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 110337 event pairs, 684 based on Foata normal form. 0/7626 useless extension candidates. Maximal degree in co-relation 10458. Up to 1031 conditions per place. [2023-11-26 11:45:29,827 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 22 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2023-11-26 11:45:29,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 393 transitions, 860 flow [2023-11-26 11:45:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions. [2023-11-26 11:45:29,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2023-11-26 11:45:29,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1180 transitions. [2023-11-26 11:45:29,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1180 transitions. [2023-11-26 11:45:29,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:29,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1180 transitions. [2023-11-26 11:45:29,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 393.3333333333333) internal successors, (1180), 3 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:29,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:29,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:29,841 INFO L175 Difference]: Start difference. First operand has 397 places, 394 transitions, 814 flow. Second operand 3 states and 1180 transitions. [2023-11-26 11:45:29,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 393 transitions, 860 flow [2023-11-26 11:45:29,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 393 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:29,851 INFO L231 Difference]: Finished difference. Result has 395 places, 393 transitions, 812 flow [2023-11-26 11:45:29,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=395, PETRI_TRANSITIONS=393} [2023-11-26 11:45:29,852 INFO L281 CegarLoopForPetriNet]: 416 programPoint places, -21 predicate places. [2023-11-26 11:45:29,852 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 393 transitions, 812 flow [2023-11-26 11:45:29,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:29,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:29,853 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] [2023-11-26 11:45:29,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 11:45:29,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2023-11-26 11:45:29,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:29,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1118261306, now seen corresponding path program 1 times [2023-11-26 11:45:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:29,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361033727] [2023-11-26 11:45:29,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:29,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:45:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361033727] [2023-11-26 11:45:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361033727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:29,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374790748] [2023-11-26 11:45:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:29,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:29,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 430 [2023-11-26 11:45:29,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 393 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:29,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:29,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 430 [2023-11-26 11:45:29,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:45:33,835 INFO L124 PetriNetUnfolderBase]: 2261/20900 cut-off events. [2023-11-26 11:45:33,835 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2023-11-26 11:45:34,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23883 conditions, 20900 events. 2261/20900 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 295804 event pairs, 1720 based on Foata normal form. 0/17502 useless extension candidates. Maximal degree in co-relation 23839. Up to 2506 conditions per place. [2023-11-26 11:45:34,275 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 26 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2023-11-26 11:45:34,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 386 transitions, 852 flow [2023-11-26 11:45:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:45:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:45:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2023-11-26 11:45:34,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9031007751937985 [2023-11-26 11:45:34,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1165 transitions. [2023-11-26 11:45:34,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1165 transitions. [2023-11-26 11:45:34,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:45:34,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1165 transitions. [2023-11-26 11:45:34,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:34,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:34,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 430.0) internal successors, (1720), 4 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:34,553 INFO L175 Difference]: Start difference. First operand has 395 places, 393 transitions, 812 flow. Second operand 3 states and 1165 transitions. [2023-11-26 11:45:34,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 386 transitions, 852 flow [2023-11-26 11:45:34,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:45:34,577 INFO L231 Difference]: Finished difference. Result has 388 places, 386 transitions, 796 flow [2023-11-26 11:45:34,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=388, PETRI_TRANSITIONS=386} [2023-11-26 11:45:34,580 INFO L281 CegarLoopForPetriNet]: 416 programPoint places, -28 predicate places. [2023-11-26 11:45:34,580 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 386 transitions, 796 flow [2023-11-26 11:45:34,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:34,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:45:34,581 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] [2023-11-26 11:45:34,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 11:45:34,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2023-11-26 11:45:34,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:45:34,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1893077291, now seen corresponding path program 1 times [2023-11-26 11:45:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:45:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350080205] [2023-11-26 11:45:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:45:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:45:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:45:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:45:34,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:45:34,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350080205] [2023-11-26 11:45:34,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350080205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:45:34,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:45:34,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:45:34,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716840623] [2023-11-26 11:45:34,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:45:34,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:45:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:45:34,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:45:34,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:45:34,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 430 [2023-11-26 11:45:34,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 386 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:45:34,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:45:34,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 430 [2023-11-26 11:45:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand