./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:06:40,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:06:40,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:06:40,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:06:40,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:06:40,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:06:40,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:06:40,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:06:40,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:06:40,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:06:40,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:06:40,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:06:40,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:06:40,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:06:40,366 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:06:40,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:06:40,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:06:40,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:06:40,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:06:40,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:06:40,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:06:40,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:06:40,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:06:40,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:06:40,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:06:40,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:06:40,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:06:40,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:06:40,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:06:40,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:06:40,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:06:40,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:06:40,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:06:40,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:06:40,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:06:40,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:06:40,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:06:40,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:06:40,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:06:40,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:06:40,374 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:06:40,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:06:40,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:06:40,375 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(reach_error())) ) 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 -> 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b [2024-01-27 15:06:40,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:06:40,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:06:40,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:06:40,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:06:40,644 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:06:40,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-01-27 15:06:41,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:06:42,069 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:06:42,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2024-01-27 15:06:42,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed862cf8/27c4b521decb4aa7ad6e0af8a8faecae/FLAGc8a95423e [2024-01-27 15:06:42,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed862cf8/27c4b521decb4aa7ad6e0af8a8faecae [2024-01-27 15:06:42,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:06:42,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:06:42,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:06:42,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:06:42,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:06:42,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d483d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42, skipping insertion in model container [2024-01-27 15:06:42,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,172 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:06:42,415 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2024-01-27 15:06:42,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:06:42,451 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:06:42,510 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i[31246,31259] [2024-01-27 15:06:42,525 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:06:42,560 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:06:42,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42 WrapperNode [2024-01-27 15:06:42,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:06:42,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:06:42,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:06:42,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:06:42,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,617 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 113 [2024-01-27 15:06:42,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:06:42,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:06:42,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:06:42,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:06:42,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,653 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 15:06:42,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:06:42,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:06:42,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:06:42,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:06:42,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (1/1) ... [2024-01-27 15:06:42,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:06:42,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:06:42,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:06:42,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:06:42,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:06:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:06:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:06:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:06:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:06:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:06:42,753 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-01-27 15:06:42,754 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-01-27 15:06:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:06:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:06:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:06:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:06:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:06:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:06:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:06:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:06:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:06:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:06:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-01-27 15:06:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-01-27 15:06:42,757 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:06:42,876 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:06:42,878 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:06:43,024 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:06:43,024 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:06:43,180 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:06:43,180 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 15:06:43,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:06:43 BoogieIcfgContainer [2024-01-27 15:06:43,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:06:43,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:06:43,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:06:43,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:06:43,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:06:42" (1/3) ... [2024-01-27 15:06:43,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510030dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:06:43, skipping insertion in model container [2024-01-27 15:06:43,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:06:42" (2/3) ... [2024-01-27 15:06:43,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510030dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:06:43, skipping insertion in model container [2024-01-27 15:06:43,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:06:43" (3/3) ... [2024-01-27 15:06:43,190 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-01-27 15:06:43,197 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:06:43,204 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:06:43,204 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:06:43,204 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:06:43,277 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 15:06:43,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 138 flow [2024-01-27 15:06:43,364 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-01-27 15:06:43,367 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:06:43,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 51 events. 2/51 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 103 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-01-27 15:06:43,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 138 flow [2024-01-27 15:06:43,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 119 flow [2024-01-27 15:06:43,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:06:43,407 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;@3a8144fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:06:43,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 15:06:43,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:06:43,429 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2024-01-27 15:06:43,429 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 15:06:43,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:43,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:43,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:43,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 908592092, now seen corresponding path program 1 times [2024-01-27 15:06:43,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768123433] [2024-01-27 15:06:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:43,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768123433] [2024-01-27 15:06:43,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768123433] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:43,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:43,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 15:06:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069665925] [2024-01-27 15:06:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:43,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:06:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:06:43,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:06:43,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-01-27 15:06:43,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:43,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:43,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-01-27 15:06:43,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:46,676 INFO L124 PetriNetUnfolderBase]: 16033/25893 cut-off events. [2024-01-27 15:06:46,677 INFO L125 PetriNetUnfolderBase]: For 2172/2172 co-relation queries the response was YES. [2024-01-27 15:06:46,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49693 conditions, 25893 events. 16033/25893 cut-off events. For 2172/2172 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 203913 event pairs, 1785 based on Foata normal form. 1382/26231 useless extension candidates. Maximal degree in co-relation 39553. Up to 6939 conditions per place. [2024-01-27 15:06:46,853 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 169 selfloop transitions, 29 changer transitions 8/217 dead transitions. [2024-01-27 15:06:46,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 217 transitions, 948 flow [2024-01-27 15:06:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:06:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:06:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 385 transitions. [2024-01-27 15:06:46,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-01-27 15:06:46,874 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 119 flow. Second operand 11 states and 385 transitions. [2024-01-27 15:06:46,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 217 transitions, 948 flow [2024-01-27 15:06:46,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 217 transitions, 887 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-01-27 15:06:46,920 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 304 flow [2024-01-27 15:06:46,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=304, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2024-01-27 15:06:46,925 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2024-01-27 15:06:46,925 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 304 flow [2024-01-27 15:06:46,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:46,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:46,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:46,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:06:46,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:46,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash 44136906, now seen corresponding path program 1 times [2024-01-27 15:06:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:46,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365757750] [2024-01-27 15:06:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365757750] [2024-01-27 15:06:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365757750] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:47,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:06:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253705358] [2024-01-27 15:06:47,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:47,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:06:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:47,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:06:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:06:47,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 55 [2024-01-27 15:06:47,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:47,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:47,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 55 [2024-01-27 15:06:47,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:48,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 4#L748-4true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,166 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-27 15:06:48,166 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:06:48,167 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:06:48,167 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-27 15:06:48,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 34#writerEXITtrue, 4#L748-4true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,198 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,199 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,199 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,199 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,215 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,216 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,216 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,219 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 4#L748-4true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,220 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,220 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,220 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,221 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 4#L748-4true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,222 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,222 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-27 15:06:48,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 34#writerEXITtrue, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,251 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,251 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,251 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,251 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 34#writerEXITtrue, 4#L748-4true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,255 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,255 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,255 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,255 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 34#writerEXITtrue, 4#L748-4true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,256 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,256 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,256 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,257 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,271 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,271 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,271 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,271 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,272 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,272 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,272 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,273 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 4#L748-4true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,274 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,274 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,274 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,275 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-27 15:06:48,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 34#writerEXITtrue, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,291 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,291 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,291 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,291 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 53#L749-2true, 95#true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,292 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,293 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,293 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,293 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 34#writerEXITtrue, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,293 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,294 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,294 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,294 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 34#writerEXITtrue, 17#readerEXITtrue, 4#L748-4true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,297 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,297 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,297 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,297 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 58#L721true, Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,310 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,311 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,311 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,311 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-27 15:06:48,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 53#L749-2true, 95#true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,322 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,322 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,322 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,323 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 34#writerEXITtrue, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 48#L749-1true, Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,323 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,324 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,324 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,324 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,325 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 55#L750-1true]) [2024-01-27 15:06:48,325 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,326 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,326 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,326 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 53#L749-2true, 95#true, 17#readerEXITtrue, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,327 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,327 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,327 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,327 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-27 15:06:48,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 44#L740true, 95#true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 55#L750-1true]) [2024-01-27 15:06:48,344 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,344 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,344 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,345 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 53#L749-2true, 95#true, 17#readerEXITtrue, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 21#L740true, Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|))]) [2024-01-27 15:06:48,345 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,345 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,345 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,346 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 27#L721true, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 55#L750-1true]) [2024-01-27 15:06:48,347 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,347 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-27 15:06:48,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([246] L739-2-->L740: Formula: (= (+ v_~r~0_7 1) v_~r~0_8) InVars {~r~0=v_~r~0_8} OutVars{~r~0=v_~r~0_7} AuxVars[] AssignedVars[~r~0][48], [readerThread1of1ForFork2InUse, 95#true, 17#readerEXITtrue, 74#(= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|), Black: 69#true, 28#writerEXITtrue, 21#L740true, Black: 78#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 80#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~y~0 ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 76#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 84#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= |readerThread1of1ForFork3_~lx~0#1| |readerThread1of1ForFork3_~ly~0#1|) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), Black: 71#(= ~x~0 |readerThread1of1ForFork3_~l~0#1|), Black: 82#(and (= |readerThread1of1ForFork3_~ly~0#1| ~x~0) (= ~x~0 |readerThread1of1ForFork3_~l~0#1|)), 55#L750-1true]) [2024-01-27 15:06:48,467 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-27 15:06:48,467 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:06:48,467 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:06:48,468 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-27 15:06:48,488 INFO L124 PetriNetUnfolderBase]: 8793/15476 cut-off events. [2024-01-27 15:06:48,488 INFO L125 PetriNetUnfolderBase]: For 1687/1928 co-relation queries the response was YES. [2024-01-27 15:06:48,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31511 conditions, 15476 events. 8793/15476 cut-off events. For 1687/1928 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 127750 event pairs, 3607 based on Foata normal form. 696/15427 useless extension candidates. Maximal degree in co-relation 28431. Up to 6851 conditions per place. [2024-01-27 15:06:48,584 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 44 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2024-01-27 15:06:48,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 444 flow [2024-01-27 15:06:48,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:06:48,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:06:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-01-27 15:06:48,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2024-01-27 15:06:48,586 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 304 flow. Second operand 3 states and 118 transitions. [2024-01-27 15:06:48,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 444 flow [2024-01-27 15:06:48,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:06:48,643 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 320 flow [2024-01-27 15:06:48,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2024-01-27 15:06:48,644 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2024-01-27 15:06:48,644 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 320 flow [2024-01-27 15:06:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:48,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:48,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:06:48,646 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:48,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash 20064264, now seen corresponding path program 2 times [2024-01-27 15:06:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013367043] [2024-01-27 15:06:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013367043] [2024-01-27 15:06:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013367043] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:48,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:48,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:06:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018915794] [2024-01-27 15:06:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:48,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:06:48,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:06:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:06:48,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-01-27 15:06:48,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:48,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:48,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-01-27 15:06:48,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:49,710 INFO L124 PetriNetUnfolderBase]: 5764/11484 cut-off events. [2024-01-27 15:06:49,710 INFO L125 PetriNetUnfolderBase]: For 4445/4553 co-relation queries the response was YES. [2024-01-27 15:06:49,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24965 conditions, 11484 events. 5764/11484 cut-off events. For 4445/4553 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 101607 event pairs, 1723 based on Foata normal form. 126/11156 useless extension candidates. Maximal degree in co-relation 21295. Up to 4105 conditions per place. [2024-01-27 15:06:49,771 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 59 selfloop transitions, 9 changer transitions 3/122 dead transitions. [2024-01-27 15:06:49,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 576 flow [2024-01-27 15:06:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:06:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:06:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2024-01-27 15:06:49,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7681818181818182 [2024-01-27 15:06:49,773 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 320 flow. Second operand 4 states and 169 transitions. [2024-01-27 15:06:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 576 flow [2024-01-27 15:06:49,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 122 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:06:49,847 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 378 flow [2024-01-27 15:06:49,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2024-01-27 15:06:49,848 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2024-01-27 15:06:49,849 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 378 flow [2024-01-27 15:06:49,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:49,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:49,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:06:49,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:06:49,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:49,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash 823824437, now seen corresponding path program 1 times [2024-01-27 15:06:49,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976296679] [2024-01-27 15:06:49,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976296679] [2024-01-27 15:06:49,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976296679] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:49,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:49,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 15:06:49,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616888651] [2024-01-27 15:06:49,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:49,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:06:49,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:49,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:06:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:06:49,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-01-27 15:06:49,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:49,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:49,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-01-27 15:06:49,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:52,186 INFO L124 PetriNetUnfolderBase]: 14627/23582 cut-off events. [2024-01-27 15:06:52,187 INFO L125 PetriNetUnfolderBase]: For 19776/20162 co-relation queries the response was YES. [2024-01-27 15:06:52,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60703 conditions, 23582 events. 14627/23582 cut-off events. For 19776/20162 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 174842 event pairs, 2450 based on Foata normal form. 254/23489 useless extension candidates. Maximal degree in co-relation 54697. Up to 5080 conditions per place. [2024-01-27 15:06:52,294 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 170 selfloop transitions, 55 changer transitions 54/296 dead transitions. [2024-01-27 15:06:52,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 296 transitions, 1800 flow [2024-01-27 15:06:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 15:06:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 15:06:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 374 transitions. [2024-01-27 15:06:52,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-01-27 15:06:52,297 INFO L175 Difference]: Start difference. First operand has 78 places, 84 transitions, 378 flow. Second operand 11 states and 374 transitions. [2024-01-27 15:06:52,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 296 transitions, 1800 flow [2024-01-27 15:06:52,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 296 transitions, 1800 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:06:52,529 INFO L231 Difference]: Finished difference. Result has 96 places, 126 transitions, 842 flow [2024-01-27 15:06:52,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=842, PETRI_PLACES=96, PETRI_TRANSITIONS=126} [2024-01-27 15:06:52,531 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 36 predicate places. [2024-01-27 15:06:52,531 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 126 transitions, 842 flow [2024-01-27 15:06:52,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:52,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:52,532 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] [2024-01-27 15:06:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:06:52,532 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:52,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 931039237, now seen corresponding path program 1 times [2024-01-27 15:06:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466741367] [2024-01-27 15:06:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466741367] [2024-01-27 15:06:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466741367] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 15:06:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921164172] [2024-01-27 15:06:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:06:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:06:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:06:52,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-01-27 15:06:52,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 126 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:52,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:52,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-01-27 15:06:52,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:54,625 INFO L124 PetriNetUnfolderBase]: 13149/21938 cut-off events. [2024-01-27 15:06:54,626 INFO L125 PetriNetUnfolderBase]: For 30973/31101 co-relation queries the response was YES. [2024-01-27 15:06:54,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64768 conditions, 21938 events. 13149/21938 cut-off events. For 30973/31101 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 168589 event pairs, 2370 based on Foata normal form. 240/22127 useless extension candidates. Maximal degree in co-relation 59442. Up to 5782 conditions per place. [2024-01-27 15:06:54,878 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 163 selfloop transitions, 62 changer transitions 12/254 dead transitions. [2024-01-27 15:06:54,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 254 transitions, 1862 flow [2024-01-27 15:06:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 15:06:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 15:06:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 323 transitions. [2024-01-27 15:06:54,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5872727272727273 [2024-01-27 15:06:54,881 INFO L175 Difference]: Start difference. First operand has 96 places, 126 transitions, 842 flow. Second operand 10 states and 323 transitions. [2024-01-27 15:06:54,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 254 transitions, 1862 flow [2024-01-27 15:06:55,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 254 transitions, 1840 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:06:55,304 INFO L231 Difference]: Finished difference. Result has 109 places, 137 transitions, 1117 flow [2024-01-27 15:06:55,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1117, PETRI_PLACES=109, PETRI_TRANSITIONS=137} [2024-01-27 15:06:55,305 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 49 predicate places. [2024-01-27 15:06:55,306 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 1117 flow [2024-01-27 15:06:55,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:55,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:55,306 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] [2024-01-27 15:06:55,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:06:55,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:55,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash 643990011, now seen corresponding path program 1 times [2024-01-27 15:06:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419150025] [2024-01-27 15:06:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:55,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:55,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419150025] [2024-01-27 15:06:55,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419150025] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:55,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:55,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 15:06:55,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391136461] [2024-01-27 15:06:55,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:55,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:06:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:06:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:06:55,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2024-01-27 15:06:55,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 1117 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:55,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:55,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2024-01-27 15:06:55,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:57,745 INFO L124 PetriNetUnfolderBase]: 13959/22743 cut-off events. [2024-01-27 15:06:57,746 INFO L125 PetriNetUnfolderBase]: For 40874/41126 co-relation queries the response was YES. [2024-01-27 15:06:57,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70389 conditions, 22743 events. 13959/22743 cut-off events. For 40874/41126 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 169488 event pairs, 2790 based on Foata normal form. 300/22911 useless extension candidates. Maximal degree in co-relation 65075. Up to 5485 conditions per place. [2024-01-27 15:06:57,851 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 169 selfloop transitions, 68 changer transitions 31/291 dead transitions. [2024-01-27 15:06:57,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 291 transitions, 2309 flow [2024-01-27 15:06:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 15:06:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 15:06:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 344 transitions. [2024-01-27 15:06:57,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6254545454545455 [2024-01-27 15:06:57,854 INFO L175 Difference]: Start difference. First operand has 109 places, 137 transitions, 1117 flow. Second operand 10 states and 344 transitions. [2024-01-27 15:06:57,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 291 transitions, 2309 flow [2024-01-27 15:06:58,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 291 transitions, 2300 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:06:58,179 INFO L231 Difference]: Finished difference. Result has 122 places, 151 transitions, 1468 flow [2024-01-27 15:06:58,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1468, PETRI_PLACES=122, PETRI_TRANSITIONS=151} [2024-01-27 15:06:58,180 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 62 predicate places. [2024-01-27 15:06:58,180 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 151 transitions, 1468 flow [2024-01-27 15:06:58,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:58,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:58,181 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] [2024-01-27 15:06:58,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:06:58,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:58,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -960330179, now seen corresponding path program 1 times [2024-01-27 15:06:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304346856] [2024-01-27 15:06:58,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:58,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:58,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304346856] [2024-01-27 15:06:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304346856] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740026693] [2024-01-27 15:06:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:06:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:06:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:06:58,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-01-27 15:06:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 151 transitions, 1468 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:58,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-01-27 15:06:58,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:06:59,506 INFO L124 PetriNetUnfolderBase]: 5078/11572 cut-off events. [2024-01-27 15:06:59,506 INFO L125 PetriNetUnfolderBase]: For 24044/24406 co-relation queries the response was YES. [2024-01-27 15:06:59,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36541 conditions, 11572 events. 5078/11572 cut-off events. For 24044/24406 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 112847 event pairs, 1579 based on Foata normal form. 444/11836 useless extension candidates. Maximal degree in co-relation 35966. Up to 2988 conditions per place. [2024-01-27 15:06:59,554 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 50 selfloop transitions, 8 changer transitions 36/168 dead transitions. [2024-01-27 15:06:59,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 168 transitions, 1336 flow [2024-01-27 15:06:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:06:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:06:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2024-01-27 15:06:59,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7163636363636363 [2024-01-27 15:06:59,556 INFO L175 Difference]: Start difference. First operand has 122 places, 151 transitions, 1468 flow. Second operand 5 states and 197 transitions. [2024-01-27 15:06:59,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 168 transitions, 1336 flow [2024-01-27 15:06:59,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 168 transitions, 1248 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-01-27 15:06:59,728 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 810 flow [2024-01-27 15:06:59,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=810, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2024-01-27 15:06:59,729 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 61 predicate places. [2024-01-27 15:06:59,729 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 810 flow [2024-01-27 15:06:59,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:59,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:06:59,730 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] [2024-01-27 15:06:59,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:06:59,730 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:06:59,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:06:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1397873173, now seen corresponding path program 2 times [2024-01-27 15:06:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:06:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578809410] [2024-01-27 15:06:59,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:06:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:06:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:06:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:06:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:06:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578809410] [2024-01-27 15:06:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578809410] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:06:59,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:06:59,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:06:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94464262] [2024-01-27 15:06:59,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:06:59,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:06:59,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:06:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:06:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:06:59,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-01-27 15:06:59,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 810 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:06:59,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:06:59,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-01-27 15:06:59,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:07:00,338 INFO L124 PetriNetUnfolderBase]: 2471/5627 cut-off events. [2024-01-27 15:07:00,339 INFO L125 PetriNetUnfolderBase]: For 11425/11431 co-relation queries the response was YES. [2024-01-27 15:07:00,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18150 conditions, 5627 events. 2471/5627 cut-off events. For 11425/11431 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 46374 event pairs, 951 based on Foata normal form. 60/5629 useless extension candidates. Maximal degree in co-relation 18120. Up to 1754 conditions per place. [2024-01-27 15:07:00,357 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 0 selfloop transitions, 0 changer transitions 101/101 dead transitions. [2024-01-27 15:07:00,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 101 transitions, 646 flow [2024-01-27 15:07:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:07:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:07:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2024-01-27 15:07:00,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-01-27 15:07:00,360 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 810 flow. Second operand 5 states and 187 transitions. [2024-01-27 15:07:00,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 101 transitions, 646 flow [2024-01-27 15:07:00,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 101 transitions, 542 flow, removed 12 selfloop flow, removed 20 redundant places. [2024-01-27 15:07:00,397 INFO L231 Difference]: Finished difference. Result has 92 places, 0 transitions, 0 flow [2024-01-27 15:07:00,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=92, PETRI_TRANSITIONS=0} [2024-01-27 15:07:00,398 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 32 predicate places. [2024-01-27 15:07:00,398 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 0 transitions, 0 flow [2024-01-27 15:07:00,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:07:00,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 15:07:00,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2024-01-27 15:07:00,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 15:07:00,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 15:07:00,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-01-27 15:07:00,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-01-27 15:07:00,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 15:07:00,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:07:00,403 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-01-27 15:07:00,407 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 15:07:00,407 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 15:07:00,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 03:07:00 BasicIcfg [2024-01-27 15:07:00,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 15:07:00,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 15:07:00,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 15:07:00,413 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 15:07:00,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:06:43" (3/4) ... [2024-01-27 15:07:00,414 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-01-27 15:07:00,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2024-01-27 15:07:00,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2024-01-27 15:07:00,420 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2024-01-27 15:07:00,420 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-01-27 15:07:00,420 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-01-27 15:07:00,421 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-01-27 15:07:00,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 15:07:00,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-01-27 15:07:00,509 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 15:07:00,510 INFO L158 Benchmark]: Toolchain (without parser) took 18400.10ms. Allocated memory was 190.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 160.4MB in the beginning and 6.3GB in the end (delta: -6.1GB). Peak memory consumption was 898.0MB. Max. memory is 16.1GB. [2024-01-27 15:07:00,511 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:07:00,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.06ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 142.6MB in the end (delta: 17.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-01-27 15:07:00,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.78ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 140.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:07:00,512 INFO L158 Benchmark]: Boogie Preprocessor took 45.67ms. Allocated memory is still 190.8MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:07:00,512 INFO L158 Benchmark]: RCFGBuilder took 514.67ms. Allocated memory is still 190.8MB. Free memory was 138.5MB in the beginning and 110.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-01-27 15:07:00,513 INFO L158 Benchmark]: TraceAbstraction took 17228.35ms. Allocated memory was 190.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 110.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-01-27 15:07:00,513 INFO L158 Benchmark]: Witness Printer took 97.15ms. Allocated memory is still 7.2GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:07:00,515 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.06ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 142.6MB in the end (delta: 17.5MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.78ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 140.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.67ms. Allocated memory is still 190.8MB. Free memory was 140.6MB in the beginning and 138.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.67ms. Allocated memory is still 190.8MB. Free memory was 138.5MB in the beginning and 110.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17228.35ms. Allocated memory was 190.8MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 110.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 97.15ms. Allocated memory is still 7.2GB. Free memory was 6.3GB in the beginning and 6.3GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 739]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 76 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 821 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 196 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2239 IncrementalHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 50 mSDtfsCounter, 2239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1468occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-01-27 15:07:00,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE