./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fab2e995569cc819974baee7d52d8d4bdabd2a2896c83fb3b8d07b44f394c5b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:09:27,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:09:27,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:09:27,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:09:27,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:09:27,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:09:27,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:09:27,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:09:27,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:09:27,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:09:27,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:09:27,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:09:27,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:09:27,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:09:27,739 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:09:27,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:09:27,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:09:27,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:09:27,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:09:27,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:09:27,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:09:27,745 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:09:27,745 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:09:27,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:09:27,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:09:27,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:09:27,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:09:27,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:09:27,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:09:27,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:09:27,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:09:27,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:09:27,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:09:27,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:09:27,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:09:27,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:09:27,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:09:27,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:09:27,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:09:27,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:09:27,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:09:27,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:09:27,751 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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-10-13 12:09:28,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:09:28,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:09:28,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:09:28,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:09:28,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:09:28,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2024-10-13 12:09:29,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:09:29,887 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:09:29,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-1.i [2024-10-13 12:09:29,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed1edad87/3807c7b26f974f588ec405e40641ff32/FLAG6330f3677 [2024-10-13 12:09:29,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed1edad87/3807c7b26f974f588ec405e40641ff32 [2024-10-13 12:09:29,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:09:29,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:09:29,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:09:29,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:09:29,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:09:29,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:29" (1/1) ... [2024-10-13 12:09:29,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b55ec59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:29, skipping insertion in model container [2024-10-13 12:09:29,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:29" (1/1) ... [2024-10-13 12:09:30,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:09:30,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:09:30,448 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:09:30,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:09:30,595 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:09:30,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30 WrapperNode [2024-10-13 12:09:30,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:09:30,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:09:30,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:09:30,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:09:30,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,656 INFO L138 Inliner]: procedures = 173, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-13 12:09:30,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:09:30,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:09:30,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:09:30,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:09:30,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,703 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:09:30,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:09:30,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:09:30,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:09:30,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:09:30,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (1/1) ... [2024-10-13 12:09:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:09:30,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:09:30,773 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-10-13 12:09:30,775 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-10-13 12:09:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:09:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:09:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-13 12:09:30,825 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-13 12:09:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:09:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:09:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:09:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:09:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-13 12:09:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-13 12:09:30,828 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:09:30,958 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:09:30,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:09:31,164 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:09:31,164 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:09:31,277 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:09:31,277 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:09:31,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:31 BoogieIcfgContainer [2024-10-13 12:09:31,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:09:31,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:09:31,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:09:31,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:09:31,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:09:29" (1/3) ... [2024-10-13 12:09:31,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af6f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:31, skipping insertion in model container [2024-10-13 12:09:31,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:30" (2/3) ... [2024-10-13 12:09:31,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69af6f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:31, skipping insertion in model container [2024-10-13 12:09:31,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:31" (3/3) ... [2024-10-13 12:09:31,288 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2024-10-13 12:09:31,305 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:09:31,305 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:09:31,305 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:09:31,383 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-13 12:09:31,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 148 flow [2024-10-13 12:09:31,464 INFO L124 PetriNetUnfolderBase]: 4/56 cut-off events. [2024-10-13 12:09:31,464 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 12:09:31,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 56 events. 4/56 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 118 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2024-10-13 12:09:31,470 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 148 flow [2024-10-13 12:09:31,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 55 transitions, 134 flow [2024-10-13 12:09:31,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:09:31,488 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@40134703, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:09:31,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:09:31,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:09:31,501 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-13 12:09:31,501 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:09:31,501 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:31,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:31,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1469700157, now seen corresponding path program 1 times [2024-10-13 12:09:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665915225] [2024-10-13 12:09:31,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665915225] [2024-10-13 12:09:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665915225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:31,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566370116] [2024-10-13 12:09:31,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:31,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:32,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:32,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-13 12:09:32,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10-13 12:09:32,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:32,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-13 12:09:32,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:35,337 INFO L124 PetriNetUnfolderBase]: 17416/27744 cut-off events. [2024-10-13 12:09:35,337 INFO L125 PetriNetUnfolderBase]: For 2582/2582 co-relation queries the response was YES. [2024-10-13 12:09:35,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53453 conditions, 27744 events. 17416/27744 cut-off events. For 2582/2582 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 219018 event pairs, 1959 based on Foata normal form. 2832/30001 useless extension candidates. Maximal degree in co-relation 46845. Up to 7302 conditions per place. [2024-10-13 12:09:35,641 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 173 selfloop transitions, 29 changer transitions 0/216 dead transitions. [2024-10-13 12:09:35,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 216 transitions, 950 flow [2024-10-13 12:09:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:09:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:09:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 447 transitions. [2024-10-13 12:09:35,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-10-13 12:09:35,663 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 134 flow. Second operand 11 states and 447 transitions. [2024-10-13 12:09:35,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 216 transitions, 950 flow [2024-10-13 12:09:35,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 216 transitions, 874 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 12:09:35,700 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 308 flow [2024-10-13 12:09:35,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=308, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2024-10-13 12:09:35,707 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2024-10-13 12:09:35,708 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 308 flow [2024-10-13 12:09:35,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 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-10-13 12:09:35,709 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:35,709 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:35,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:09:35,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1448217602, now seen corresponding path program 1 times [2024-10-13 12:09:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518823991] [2024-10-13 12:09:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518823991] [2024-10-13 12:09:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518823991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:35,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:09:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869880342] [2024-10-13 12:09:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:35,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:09:35,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:35,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:09:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:09:35,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2024-10-13 12:09:35,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-10-13 12:09:35,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:35,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2024-10-13 12:09:35,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:37,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 59#L721true, 16#L16true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,465 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:09:37,466 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:09:37,466 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:09:37,466 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:09:37,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,559 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,559 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,559 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,560 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,593 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 16#L16true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,597 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,597 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,597 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,598 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,600 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,600 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,600 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,600 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:09:37,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,674 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,674 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,674 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,674 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,678 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,679 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,679 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,680 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,681 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,681 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,681 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,682 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,708 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,712 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,712 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,712 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,712 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,716 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,716 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,717 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,717 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,719 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,720 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,720 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,720 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:09:37,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 6#L749true, 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,777 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,778 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,778 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,778 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 54#L749-1true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,780 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,781 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,781 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,781 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,782 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,782 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,782 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,782 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,787 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,787 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,787 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,787 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:37,789 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,790 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,790 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:37,790 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,039 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,039 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,039 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,040 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,041 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,041 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,041 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,041 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,053 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,053 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,053 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,054 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:09:38,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 16#L16true, 50#L740true, 54#L749-1true, 15#writerEXITtrue, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,081 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,081 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,082 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,082 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,082 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,082 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,082 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,083 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, Black: 72#true, 98#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,084 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,085 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,085 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,085 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,085 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,086 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,086 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,086 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 8#L748-4true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 15#writerEXITtrue, Black: 72#true, 98#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,089 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,089 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,089 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,089 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 28#L721true, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,105 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,105 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,105 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,105 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:09:38,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 24#L740true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,119 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,119 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,119 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,119 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 30#writerEXITtrue, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 6#L749true, 50#L740true, 15#writerEXITtrue, 98#true, Black: 72#true, 45#readerEXITtrue, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,120 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,120 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,120 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,120 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 59#L721true, 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,122 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,122 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,122 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,123 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:09:38,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] 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], [Black: 87#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 81#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), 77#(= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|), 50#L740true, 54#L749-1true, 15#writerEXITtrue, 98#true, Black: 72#true, Black: 74#(= |readerThread1of1ForFork2_~l~0#1| ~x~0), 45#readerEXITtrue, Black: 83#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0) (= |readerThread1of1ForFork2_~lx~0#1| |readerThread1of1ForFork2_~ly~0#1|)), Black: 85#(and (= ~x~0 |readerThread1of1ForFork2_~ly~0#1|) (= |readerThread1of1ForFork2_~l~0#1| ~x~0)), Black: 79#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork2_~l~0#1| ~x~0))]) [2024-10-13 12:09:38,138 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-13 12:09:38,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:09:38,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:09:38,138 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:09:38,157 INFO L124 PetriNetUnfolderBase]: 11121/19209 cut-off events. [2024-10-13 12:09:38,157 INFO L125 PetriNetUnfolderBase]: For 6118/6479 co-relation queries the response was YES. [2024-10-13 12:09:38,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40057 conditions, 19209 events. 11121/19209 cut-off events. For 6118/6479 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 163292 event pairs, 4352 based on Foata normal form. 1102/19533 useless extension candidates. Maximal degree in co-relation 30319. Up to 8376 conditions per place. [2024-10-13 12:09:38,344 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 44 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2024-10-13 12:09:38,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 453 flow [2024-10-13 12:09:38,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:09:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:09:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-10-13 12:09:38,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-10-13 12:09:38,346 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 308 flow. Second operand 3 states and 130 transitions. [2024-10-13 12:09:38,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 453 flow [2024-10-13 12:09:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 99 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:09:38,443 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 324 flow [2024-10-13 12:09:38,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=324, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-10-13 12:09:38,444 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2024-10-13 12:09:38,444 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 324 flow [2024-10-13 12:09:38,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-10-13 12:09:38,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:38,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:38,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:09:38,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:38,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1448682112, now seen corresponding path program 2 times [2024-10-13 12:09:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161305774] [2024-10-13 12:09:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161305774] [2024-10-13 12:09:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161305774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:38,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:38,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:09:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108756132] [2024-10-13 12:09:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:38,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:09:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:09:38,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:09:38,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-13 12:09:38,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10-13 12:09:38,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:38,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-13 12:09:38,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:39,675 INFO L124 PetriNetUnfolderBase]: 6415/12244 cut-off events. [2024-10-13 12:09:39,675 INFO L125 PetriNetUnfolderBase]: For 6169/6306 co-relation queries the response was YES. [2024-10-13 12:09:39,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26891 conditions, 12244 events. 6415/12244 cut-off events. For 6169/6306 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 106466 event pairs, 1785 based on Foata normal form. 305/12221 useless extension candidates. Maximal degree in co-relation 21047. Up to 4096 conditions per place. [2024-10-13 12:09:39,797 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 61 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2024-10-13 12:09:39,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 587 flow [2024-10-13 12:09:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:09:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:09:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2024-10-13 12:09:39,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-13 12:09:39,799 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 324 flow. Second operand 4 states and 184 transitions. [2024-10-13 12:09:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 587 flow [2024-10-13 12:09:39,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 123 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:09:39,875 INFO L231 Difference]: Finished difference. Result has 79 places, 88 transitions, 390 flow [2024-10-13 12:09:39,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2024-10-13 12:09:39,877 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2024-10-13 12:09:39,877 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 390 flow [2024-10-13 12:09:39,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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-10-13 12:09:39,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:39,878 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:09:39,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash 694497925, now seen corresponding path program 1 times [2024-10-13 12:09:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:39,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949807337] [2024-10-13 12:09:39,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949807337] [2024-10-13 12:09:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949807337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455311875] [2024-10-13 12:09:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:39,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:39,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:40,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-13 12:09:40,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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-10-13 12:09:40,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:40,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-13 12:09:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:42,286 INFO L124 PetriNetUnfolderBase]: 14821/23959 cut-off events. [2024-10-13 12:09:42,286 INFO L125 PetriNetUnfolderBase]: For 21829/22268 co-relation queries the response was YES. [2024-10-13 12:09:42,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61630 conditions, 23959 events. 14821/23959 cut-off events. For 21829/22268 co-relation queries the response was YES. Maximal size of possible extension queue 1212. Compared 180380 event pairs, 2430 based on Foata normal form. 378/24039 useless extension candidates. Maximal degree in co-relation 52329. Up to 5430 conditions per place. [2024-10-13 12:09:42,662 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 203 selfloop transitions, 63 changer transitions 0/286 dead transitions. [2024-10-13 12:09:42,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 1786 flow [2024-10-13 12:09:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:09:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:09:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 410 transitions. [2024-10-13 12:09:42,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-10-13 12:09:42,665 INFO L175 Difference]: Start difference. First operand has 79 places, 88 transitions, 390 flow. Second operand 11 states and 410 transitions. [2024-10-13 12:09:42,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 1786 flow [2024-10-13 12:09:42,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 286 transitions, 1786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:09:42,924 INFO L231 Difference]: Finished difference. Result has 97 places, 141 transitions, 950 flow [2024-10-13 12:09:42,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=950, PETRI_PLACES=97, PETRI_TRANSITIONS=141} [2024-10-13 12:09:42,926 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 33 predicate places. [2024-10-13 12:09:42,927 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 141 transitions, 950 flow [2024-10-13 12:09:42,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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-10-13 12:09:42,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:42,928 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:42,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:09:42,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:42,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash -179792158, now seen corresponding path program 1 times [2024-10-13 12:09:42,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:42,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007392289] [2024-10-13 12:09:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:42,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007392289] [2024-10-13 12:09:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007392289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:43,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085222326] [2024-10-13 12:09:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:43,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:43,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:43,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-13 12:09:43,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 141 transitions, 950 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-10-13 12:09:43,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:43,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-13 12:09:43,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:45,657 INFO L124 PetriNetUnfolderBase]: 14830/23804 cut-off events. [2024-10-13 12:09:45,658 INFO L125 PetriNetUnfolderBase]: For 37865/38088 co-relation queries the response was YES. [2024-10-13 12:09:45,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71421 conditions, 23804 events. 14830/23804 cut-off events. For 37865/38088 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 177318 event pairs, 2456 based on Foata normal form. 322/24019 useless extension candidates. Maximal degree in co-relation 62631. Up to 6361 conditions per place. [2024-10-13 12:09:46,172 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 182 selfloop transitions, 76 changer transitions 0/278 dead transitions. [2024-10-13 12:09:46,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 278 transitions, 2129 flow [2024-10-13 12:09:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:09:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:09:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2024-10-13 12:09:46,176 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-10-13 12:09:46,176 INFO L175 Difference]: Start difference. First operand has 97 places, 141 transitions, 950 flow. Second operand 10 states and 365 transitions. [2024-10-13 12:09:46,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 278 transitions, 2129 flow [2024-10-13 12:09:46,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 278 transitions, 2127 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-13 12:09:46,660 INFO L231 Difference]: Finished difference. Result has 111 places, 158 transitions, 1347 flow [2024-10-13 12:09:46,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1347, PETRI_PLACES=111, PETRI_TRANSITIONS=158} [2024-10-13 12:09:46,662 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 47 predicate places. [2024-10-13 12:09:46,662 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 158 transitions, 1347 flow [2024-10-13 12:09:46,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-10-13 12:09:46,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:46,663 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:46,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:09:46,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash -906541507, now seen corresponding path program 1 times [2024-10-13 12:09:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:46,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718001193] [2024-10-13 12:09:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:46,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718001193] [2024-10-13 12:09:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718001193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:46,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:46,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358319099] [2024-10-13 12:09:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:46,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:46,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:46,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2024-10-13 12:09:46,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 158 transitions, 1347 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-10-13 12:09:46,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:46,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2024-10-13 12:09:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:49,567 INFO L124 PetriNetUnfolderBase]: 14937/23884 cut-off events. [2024-10-13 12:09:49,568 INFO L125 PetriNetUnfolderBase]: For 56713/57082 co-relation queries the response was YES. [2024-10-13 12:09:49,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75545 conditions, 23884 events. 14937/23884 cut-off events. For 56713/57082 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 175227 event pairs, 2302 based on Foata normal form. 464/24238 useless extension candidates. Maximal degree in co-relation 67993. Up to 6137 conditions per place. [2024-10-13 12:09:49,843 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 195 selfloop transitions, 86 changer transitions 0/307 dead transitions. [2024-10-13 12:09:49,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 307 transitions, 2643 flow [2024-10-13 12:09:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:09:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:09:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 375 transitions. [2024-10-13 12:09:49,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-10-13 12:09:49,851 INFO L175 Difference]: Start difference. First operand has 111 places, 158 transitions, 1347 flow. Second operand 10 states and 375 transitions. [2024-10-13 12:09:49,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 307 transitions, 2643 flow [2024-10-13 12:09:50,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 307 transitions, 2634 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-13 12:09:50,677 INFO L231 Difference]: Finished difference. Result has 124 places, 176 transitions, 1816 flow [2024-10-13 12:09:50,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1816, PETRI_PLACES=124, PETRI_TRANSITIONS=176} [2024-10-13 12:09:50,678 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 60 predicate places. [2024-10-13 12:09:50,678 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 176 transitions, 1816 flow [2024-10-13 12:09:50,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-10-13 12:09:50,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:50,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:50,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:09:50,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:50,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 393231477, now seen corresponding path program 1 times [2024-10-13 12:09:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243756195] [2024-10-13 12:09:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:50,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:50,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243756195] [2024-10-13 12:09:50,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243756195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:50,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:50,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:09:50,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739175620] [2024-10-13 12:09:50,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:50,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:09:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:09:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:09:50,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-13 12:09:50,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 176 transitions, 1816 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-10-13 12:09:50,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:50,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-13 12:09:50,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:52,757 INFO L124 PetriNetUnfolderBase]: 6885/13955 cut-off events. [2024-10-13 12:09:52,758 INFO L125 PetriNetUnfolderBase]: For 37349/38058 co-relation queries the response was YES. [2024-10-13 12:09:52,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43596 conditions, 13955 events. 6885/13955 cut-off events. For 37349/38058 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 128742 event pairs, 2013 based on Foata normal form. 694/14383 useless extension candidates. Maximal degree in co-relation 41861. Up to 3918 conditions per place. [2024-10-13 12:09:52,954 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 59 selfloop transitions, 15 changer transitions 0/185 dead transitions. [2024-10-13 12:09:52,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 185 transitions, 1594 flow [2024-10-13 12:09:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:09:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:09:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-10-13 12:09:52,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7133333333333334 [2024-10-13 12:09:52,957 INFO L175 Difference]: Start difference. First operand has 124 places, 176 transitions, 1816 flow. Second operand 5 states and 214 transitions. [2024-10-13 12:09:52,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 185 transitions, 1594 flow [2024-10-13 12:09:53,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 185 transitions, 1483 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-10-13 12:09:53,516 INFO L231 Difference]: Finished difference. Result has 122 places, 152 transitions, 1305 flow [2024-10-13 12:09:53,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1305, PETRI_PLACES=122, PETRI_TRANSITIONS=152} [2024-10-13 12:09:53,518 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 58 predicate places. [2024-10-13 12:09:53,518 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 152 transitions, 1305 flow [2024-10-13 12:09:53,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-10-13 12:09:53,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:53,519 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:53,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:09:53,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:53,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -941850979, now seen corresponding path program 2 times [2024-10-13 12:09:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789324295] [2024-10-13 12:09:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:53,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789324295] [2024-10-13 12:09:53,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789324295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:53,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:53,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:09:53,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393893837] [2024-10-13 12:09:53,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:53,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:09:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:09:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:09:53,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2024-10-13 12:09:53,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 152 transitions, 1305 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-10-13 12:09:53,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:53,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2024-10-13 12:09:53,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:54,898 INFO L124 PetriNetUnfolderBase]: 4904/10164 cut-off events. [2024-10-13 12:09:54,899 INFO L125 PetriNetUnfolderBase]: For 23182/23874 co-relation queries the response was YES. [2024-10-13 12:09:54,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32684 conditions, 10164 events. 4904/10164 cut-off events. For 23182/23874 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 88215 event pairs, 1234 based on Foata normal form. 483/10511 useless extension candidates. Maximal degree in co-relation 31964. Up to 2756 conditions per place. [2024-10-13 12:09:55,036 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 60 selfloop transitions, 17 changer transitions 0/148 dead transitions. [2024-10-13 12:09:55,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 148 transitions, 1120 flow [2024-10-13 12:09:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:09:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:09:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2024-10-13 12:09:55,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-10-13 12:09:55,039 INFO L175 Difference]: Start difference. First operand has 122 places, 152 transitions, 1305 flow. Second operand 5 states and 215 transitions. [2024-10-13 12:09:55,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 148 transitions, 1120 flow [2024-10-13 12:09:55,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 148 transitions, 976 flow, removed 12 selfloop flow, removed 19 redundant places. [2024-10-13 12:09:55,480 INFO L231 Difference]: Finished difference. Result has 101 places, 110 transitions, 765 flow [2024-10-13 12:09:55,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=101, PETRI_TRANSITIONS=110} [2024-10-13 12:09:55,481 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 37 predicate places. [2024-10-13 12:09:55,481 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 110 transitions, 765 flow [2024-10-13 12:09:55,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-10-13 12:09:55,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:55,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:55,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 12:09:55,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:55,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1167592489, now seen corresponding path program 1 times [2024-10-13 12:09:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:55,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022072273] [2024-10-13 12:09:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:55,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:55,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:55,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022072273] [2024-10-13 12:09:55,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022072273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:55,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:55,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:09:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482917756] [2024-10-13 12:09:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:55,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:09:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:09:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:09:55,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2024-10-13 12:09:55,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 110 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-10-13 12:09:55,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:55,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2024-10-13 12:09:55,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:56,342 INFO L124 PetriNetUnfolderBase]: 4988/9509 cut-off events. [2024-10-13 12:09:56,342 INFO L125 PetriNetUnfolderBase]: For 23022/23711 co-relation queries the response was YES. [2024-10-13 12:09:56,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29371 conditions, 9509 events. 4988/9509 cut-off events. For 23022/23711 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 76412 event pairs, 4259 based on Foata normal form. 81/9252 useless extension candidates. Maximal degree in co-relation 7284. Up to 7282 conditions per place. [2024-10-13 12:09:56,396 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 109/109 dead transitions. [2024-10-13 12:09:56,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 841 flow [2024-10-13 12:09:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:09:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:09:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-13 12:09:56,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-10-13 12:09:56,399 INFO L175 Difference]: Start difference. First operand has 101 places, 110 transitions, 765 flow. Second operand 3 states and 107 transitions. [2024-10-13 12:09:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 841 flow [2024-10-13 12:09:56,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 819 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-13 12:09:56,449 INFO L231 Difference]: Finished difference. Result has 100 places, 0 transitions, 0 flow [2024-10-13 12:09:56,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=100, PETRI_TRANSITIONS=0} [2024-10-13 12:09:56,450 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 36 predicate places. [2024-10-13 12:09:56,450 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 0 transitions, 0 flow [2024-10-13 12:09:56,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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-10-13 12:09:56,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-13 12:09:56,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:09:56,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2024-10-13 12:09:56,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:09:56,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-13 12:09:56,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-13 12:09:56,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2024-10-13 12:09:56,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:09:56,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 12:09:56,456 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-10-13 12:09:56,462 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:09:56,463 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:09:56,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:09:56 BasicIcfg [2024-10-13 12:09:56,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:09:56,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:09:56,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:09:56,474 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:09:56,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:31" (3/4) ... [2024-10-13 12:09:56,476 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 12:09:56,479 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reader [2024-10-13 12:09:56,480 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure writer [2024-10-13 12:09:56,486 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-10-13 12:09:56,488 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 12:09:56,488 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 12:09:56,488 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 12:09:56,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 12:09:56,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 12:09:56,582 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:09:56,583 INFO L158 Benchmark]: Toolchain (without parser) took 26645.42ms. Allocated memory was 138.4MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 65.5MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-13 12:09:56,583 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 138.4MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:09:56,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.22ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 65.2MB in the beginning and 146.3MB in the end (delta: -81.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-10-13 12:09:56,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.56ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:56,584 INFO L158 Benchmark]: Boogie Preprocessor took 70.33ms. Allocated memory is still 182.5MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:56,584 INFO L158 Benchmark]: RCFGBuilder took 547.16ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 120.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:56,584 INFO L158 Benchmark]: TraceAbstraction took 25192.13ms. Allocated memory was 182.5MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 119.0MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-10-13 12:09:56,585 INFO L158 Benchmark]: Witness Printer took 108.57ms. Allocated memory is still 10.0GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:09:56,588 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.23ms. Allocated memory is still 138.4MB. Free memory is still 98.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.22ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 65.2MB in the beginning and 146.3MB in the end (delta: -81.1MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.56ms. Allocated memory is still 182.5MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.33ms. Allocated memory is still 182.5MB. Free memory was 144.2MB in the beginning and 142.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.16ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 120.1MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25192.13ms. Allocated memory was 182.5MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 119.0MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 108.57ms. Allocated memory is still 10.0GB. Free memory was 8.6GB in the beginning and 8.6GB 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: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 743]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 8 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: 25.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 782 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 744 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2105 IncrementalHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 61 mSDtfsCounter, 2105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1816occurred in iteration=6, InterpolantAutomatonStates: 62, 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.9s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 12:09:56,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE