./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-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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-2.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:52:14,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:52:14,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:52:14,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:52:14,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:52:14,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:52:14,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:52:14,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:52:14,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:52:14,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:52:14,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:52:14,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:52:14,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:52:14,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:52:14,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:52:14,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:52:14,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:52:14,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:52:14,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:52:14,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:52:14,414 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:52:14,415 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:52:14,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:52:14,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:52:14,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:52:14,417 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:52:14,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:52:14,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:52:14,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:52:14,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:52:14,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:52:14,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:52:14,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:52:14,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:52:14,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:52:14,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:52:14,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:52:14,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:52:14,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:52:14,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:52:14,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:52:14,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:52:14,422 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-10-24 18:52:14,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:52:14,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:52:14,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:52:14,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:52:14,707 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:52:14,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-24 18:52:16,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:52:16,312 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:52:16,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-24 18:52:16,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c069a130f/29235cb5791a4cc593f5ced6652834e3/FLAGa87149a34 [2024-10-24 18:52:16,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c069a130f/29235cb5791a4cc593f5ced6652834e3 [2024-10-24 18:52:16,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:52:16,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:52:16,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:52:16,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:52:16,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:52:16,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26846bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16, skipping insertion in model container [2024-10-24 18:52:16,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:52:16,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:52:16,781 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:52:16,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:52:16,889 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:52:16,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16 WrapperNode [2024-10-24 18:52:16,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:52:16,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:52:16,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:52:16,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:52:16,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,940 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2024-10-24 18:52:16,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:52:16,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:52:16,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:52:16,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:52:16,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,983 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-24 18:52:16,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:16,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:52:16,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:52:16,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:52:17,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:52:17,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (1/1) ... [2024-10-24 18:52:17,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:52:17,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:52:17,035 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-24 18:52:17,054 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-24 18:52:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 18:52:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:52:17,142 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-24 18:52:17,142 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-24 18:52:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 18:52:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 18:52:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:52:17,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:52:17,143 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-24 18:52:17,143 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-24 18:52:17,144 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 18:52:17,261 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:52:17,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:52:17,412 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 18:52:17,412 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:52:17,507 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:52:17,507 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 18:52:17,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:17 BoogieIcfgContainer [2024-10-24 18:52:17,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:52:17,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:52:17,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:52:17,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:52:17,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:52:16" (1/3) ... [2024-10-24 18:52:17,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd0b49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:17, skipping insertion in model container [2024-10-24 18:52:17,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:16" (2/3) ... [2024-10-24 18:52:17,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd0b49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:17, skipping insertion in model container [2024-10-24 18:52:17,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:17" (3/3) ... [2024-10-24 18:52:17,521 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-24 18:52:17,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:52:17,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 18:52:17,538 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 18:52:17,605 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-24 18:52:17,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-10-24 18:52:17,682 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-24 18:52:17,683 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 18:52:17,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-24 18:52:17,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-10-24 18:52:17,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-10-24 18:52:17,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:52:17,716 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;@2ab6c6d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:52:17,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-24 18:52:17,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 18:52:17,738 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-24 18:52:17,738 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 18:52:17,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:17,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:17,740 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-24 18:52:17,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash 636066479, now seen corresponding path program 1 times [2024-10-24 18:52:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224276316] [2024-10-24 18:52:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:18,097 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-24 18:52:18,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:18,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224276316] [2024-10-24 18:52:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224276316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:52:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38723089] [2024-10-24 18:52:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:18,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:52:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:18,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:52:18,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:52:18,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:18,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-24 18:52:18,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:18,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:18,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:21,051 INFO L124 PetriNetUnfolderBase]: 14102/24421 cut-off events. [2024-10-24 18:52:21,052 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2024-10-24 18:52:21,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45384 conditions, 24421 events. 14102/24421 cut-off events. For 2090/2090 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 210247 event pairs, 1527 based on Foata normal form. 2538/26333 useless extension candidates. Maximal degree in co-relation 40085. Up to 6266 conditions per place. [2024-10-24 18:52:21,255 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2024-10-24 18:52:21,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2024-10-24 18:52:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 18:52:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 18:52:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2024-10-24 18:52:21,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2024-10-24 18:52:21,276 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2024-10-24 18:52:21,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2024-10-24 18:52:21,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-24 18:52:21,303 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2024-10-24 18:52:21,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2024-10-24 18:52:21,310 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-10-24 18:52:21,310 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2024-10-24 18:52:21,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 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-24 18:52:21,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:21,311 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:21,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 18:52:21,311 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-24 18:52:21,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash 300194929, now seen corresponding path program 1 times [2024-10-24 18:52:21,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:21,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663553919] [2024-10-24 18:52:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:21,425 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-24 18:52:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:21,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663553919] [2024-10-24 18:52:21,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663553919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:21,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:21,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:52:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534978668] [2024-10-24 18:52:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:52:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:21,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:52:21,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:52:21,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-24 18:52:21,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-24 18:52:21,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:21,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-24 18:52:21,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:22,663 INFO L124 PetriNetUnfolderBase]: 6834/13886 cut-off events. [2024-10-24 18:52:22,663 INFO L125 PetriNetUnfolderBase]: For 4976/5295 co-relation queries the response was YES. [2024-10-24 18:52:22,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28294 conditions, 13886 events. 6834/13886 cut-off events. For 4976/5295 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 134465 event pairs, 2739 based on Foata normal form. 717/13669 useless extension candidates. Maximal degree in co-relation 22139. Up to 5307 conditions per place. [2024-10-24 18:52:22,784 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2024-10-24 18:52:22,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2024-10-24 18:52:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:52:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:52:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-10-24 18:52:22,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-10-24 18:52:22,786 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2024-10-24 18:52:22,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2024-10-24 18:52:22,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:22,970 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2024-10-24 18:52:22,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2024-10-24 18:52:22,971 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-10-24 18:52:22,971 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2024-10-24 18:52:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-24 18:52:22,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:22,972 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 18:52:22,972 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-24 18:52:22,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1645647337, now seen corresponding path program 2 times [2024-10-24 18:52:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891583945] [2024-10-24 18:52:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:23,055 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-24 18:52:23,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:23,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891583945] [2024-10-24 18:52:23,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891583945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:23,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:52:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501840771] [2024-10-24 18:52:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:23,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-24 18:52:23,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 18:52:23,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:23,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-24 18:52:23,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:24,302 INFO L124 PetriNetUnfolderBase]: 6316/12591 cut-off events. [2024-10-24 18:52:24,303 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2024-10-24 18:52:24,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27257 conditions, 12591 events. 6316/12591 cut-off events. For 6176/6368 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 113465 event pairs, 1680 based on Foata normal form. 318/12552 useless extension candidates. Maximal degree in co-relation 24216. Up to 3792 conditions per place. [2024-10-24 18:52:24,380 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-10-24 18:52:24,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 632 flow [2024-10-24 18:52:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:52:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 18:52:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-24 18:52:24,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-10-24 18:52:24,383 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 192 transitions. [2024-10-24 18:52:24,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 632 flow [2024-10-24 18:52:24,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 18:52:24,488 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2024-10-24 18:52:24,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2024-10-24 18:52:24,489 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-10-24 18:52:24,490 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2024-10-24 18:52:24,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 18:52:24,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:24,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:24,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 18:52:24,491 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-24 18:52:24,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash -763757256, now seen corresponding path program 1 times [2024-10-24 18:52:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579196204] [2024-10-24 18:52:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:24,561 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-24 18:52:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579196204] [2024-10-24 18:52:24,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579196204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:24,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:24,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:52:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789613303] [2024-10-24 18:52:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:24,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:52:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:52:24,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:52:24,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:24,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 18:52:24,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:24,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:24,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:26,503 INFO L124 PetriNetUnfolderBase]: 13472/22783 cut-off events. [2024-10-24 18:52:26,503 INFO L125 PetriNetUnfolderBase]: For 21011/21745 co-relation queries the response was YES. [2024-10-24 18:52:26,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56662 conditions, 22783 events. 13472/22783 cut-off events. For 21011/21745 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 182277 event pairs, 2029 based on Foata normal form. 460/22855 useless extension candidates. Maximal degree in co-relation 52344. Up to 5101 conditions per place. [2024-10-24 18:52:26,659 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 201 selfloop transitions, 70 changer transitions 0/301 dead transitions. [2024-10-24 18:52:26,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 1810 flow [2024-10-24 18:52:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 18:52:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 18:52:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2024-10-24 18:52:26,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6253101736972705 [2024-10-24 18:52:26,662 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 504 transitions. [2024-10-24 18:52:26,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 1810 flow [2024-10-24 18:52:27,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 301 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:27,009 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2024-10-24 18:52:27,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1038, PETRI_PLACES=105, PETRI_TRANSITIONS=157} [2024-10-24 18:52:27,011 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-10-24 18:52:27,011 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2024-10-24 18:52:27,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 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-24 18:52:27,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:27,013 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-24 18:52:27,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 18:52:27,013 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-24 18:52:27,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash -911065372, now seen corresponding path program 1 times [2024-10-24 18:52:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813771398] [2024-10-24 18:52:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:27,099 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-24 18:52:27,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:27,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813771398] [2024-10-24 18:52:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813771398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:27,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:27,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:52:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271217589] [2024-10-24 18:52:27,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:52:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:27,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:52:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:52:27,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:27,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 157 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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-24 18:52:27,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:27,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:27,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:29,472 INFO L124 PetriNetUnfolderBase]: 14310/24144 cut-off events. [2024-10-24 18:52:29,472 INFO L125 PetriNetUnfolderBase]: For 36560/36909 co-relation queries the response was YES. [2024-10-24 18:52:29,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70727 conditions, 24144 events. 14310/24144 cut-off events. For 36560/36909 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 194157 event pairs, 3049 based on Foata normal form. 444/24353 useless extension candidates. Maximal degree in co-relation 66403. Up to 7170 conditions per place. [2024-10-24 18:52:29,661 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 198 selfloop transitions, 87 changer transitions 0/315 dead transitions. [2024-10-24 18:52:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 315 transitions, 2346 flow [2024-10-24 18:52:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 18:52:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 18:52:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 484 transitions. [2024-10-24 18:52:29,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004962779156328 [2024-10-24 18:52:29,664 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 484 transitions. [2024-10-24 18:52:29,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 315 transitions, 2346 flow [2024-10-24 18:52:30,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 315 transitions, 2344 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:30,518 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2024-10-24 18:52:30,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1516, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2024-10-24 18:52:30,520 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-10-24 18:52:30,520 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2024-10-24 18:52:30,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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-24 18:52:30,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:30,521 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-24 18:52:30,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 18:52:30,521 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-24 18:52:30,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1825893142, now seen corresponding path program 1 times [2024-10-24 18:52:30,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:30,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303507556] [2024-10-24 18:52:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:30,593 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-24 18:52:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 18:52:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303507556] [2024-10-24 18:52:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303507556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:30,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:30,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:52:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105153584] [2024-10-24 18:52:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:30,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 18:52:30,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 18:52:30,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 18:52:30,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:52:30,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:30,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1516 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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-24 18:52:30,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:30,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:30,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:33,083 INFO L124 PetriNetUnfolderBase]: 15074/25341 cut-off events. [2024-10-24 18:52:33,083 INFO L125 PetriNetUnfolderBase]: For 55380/55972 co-relation queries the response was YES. [2024-10-24 18:52:33,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78221 conditions, 25341 events. 15074/25341 cut-off events. For 55380/55972 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 202802 event pairs, 2998 based on Foata normal form. 648/25708 useless extension candidates. Maximal degree in co-relation 74131. Up to 7239 conditions per place. [2024-10-24 18:52:33,261 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 212 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2024-10-24 18:52:33,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 2914 flow [2024-10-24 18:52:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 18:52:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 18:52:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2024-10-24 18:52:33,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029776674937966 [2024-10-24 18:52:33,264 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 486 transitions. [2024-10-24 18:52:33,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 2914 flow [2024-10-24 18:52:34,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 2900 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-10-24 18:52:34,391 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2024-10-24 18:52:34,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2010, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2024-10-24 18:52:34,392 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2024-10-24 18:52:34,393 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2024-10-24 18:52:34,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 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-24 18:52:34,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:34,393 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] [2024-10-24 18:52:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 18:52:34,393 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-24 18:52:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash -700195909, now seen corresponding path program 1 times [2024-10-24 18:52:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 18:52:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081315251] [2024-10-24 18:52:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 18:52:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:52:34,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 18:52:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 18:52:34,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 18:52:34,456 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 18:52:34,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-24 18:52:34,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-24 18:52:34,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-24 18:52:34,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-24 18:52:34,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-24 18:52:34,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-24 18:52:34,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-24 18:52:34,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-24 18:52:34,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 18:52:34,463 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-24 18:52:34,534 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 18:52:34,534 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 18:52:34,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:52:34 BasicIcfg [2024-10-24 18:52:34,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 18:52:34,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 18:52:34,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 18:52:34,541 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 18:52:34,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:17" (3/4) ... [2024-10-24 18:52:34,543 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 18:52:34,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 18:52:34,545 INFO L158 Benchmark]: Toolchain (without parser) took 18194.85ms. Allocated memory was 169.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 100.7MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 941.9MB. Max. memory is 16.1GB. [2024-10-24 18:52:34,548 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:52:34,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.22ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 78.6MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 18:52:34,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 169.9MB. Free memory was 78.6MB in the beginning and 76.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 18:52:34,549 INFO L158 Benchmark]: Boogie Preprocessor took 54.54ms. Allocated memory is still 169.9MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 18:52:34,549 INFO L158 Benchmark]: RCFGBuilder took 510.55ms. Allocated memory is still 169.9MB. Free memory was 74.4MB in the beginning and 121.5MB in the end (delta: -47.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 18:52:34,549 INFO L158 Benchmark]: TraceAbstraction took 17026.94ms. Allocated memory was 169.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.6MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 961.4MB. Max. memory is 16.1GB. [2024-10-24 18:52:34,549 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 8.0GB. Free memory was 7.0GB in the beginning and 7.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:52:34,554 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.22ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 78.6MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.29ms. Allocated memory is still 169.9MB. Free memory was 78.6MB in the beginning and 76.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.54ms. Allocated memory is still 169.9MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 510.55ms. Allocated memory is still 169.9MB. Free memory was 74.4MB in the beginning and 121.5MB in the end (delta: -47.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17026.94ms. Allocated memory was 169.9MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 120.6MB in the beginning and 7.0GB in the end (delta: -6.8GB). Peak memory consumption was 961.4MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 8.0GB. Free memory was 7.0GB in the beginning and 7.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 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: 16.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1870 IncrementalHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 115 mSDtfsCounter, 1870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2010occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 18:52:34,587 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:52:37,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:52:37,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 18:52:37,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:52:37,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:52:37,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:52:37,219 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:52:37,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:52:37,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:52:37,220 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:52:37,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:52:37,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:52:37,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:52:37,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:52:37,224 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:52:37,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:52:37,224 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:52:37,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:52:37,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:52:37,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:52:37,229 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:52:37,229 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:52:37,229 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:52:37,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:52:37,230 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:52:37,230 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:52:37,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:52:37,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:52:37,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:52:37,231 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:52:37,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:52:37,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:52:37,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:52:37,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:52:37,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:52:37,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:52:37,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:52:37,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:52:37,237 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:52:37,238 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:52:37,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:52:37,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:52:37,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:52:37,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:52:37,239 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:52:37,239 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-10-24 18:52:37,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:52:37,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:52:37,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:52:37,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:52:37,604 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:52:37,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-24 18:52:39,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:52:39,431 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:52:39,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-24 18:52:39,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea07d694f/f71f365c5372467e817727eb0592d02c/FLAGae621efc7 [2024-10-24 18:52:39,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea07d694f/f71f365c5372467e817727eb0592d02c [2024-10-24 18:52:39,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:52:39,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:52:39,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:52:39,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:52:39,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:52:39,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:39" (1/1) ... [2024-10-24 18:52:39,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c1cb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:39, skipping insertion in model container [2024-10-24 18:52:39,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:52:39" (1/1) ... [2024-10-24 18:52:39,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:52:40,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:52:40,212 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:52:40,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:52:40,328 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:52:40,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40 WrapperNode [2024-10-24 18:52:40,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:52:40,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:52:40,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:52:40,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:52:40,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,390 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2024-10-24 18:52:40,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:52:40,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:52:40,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:52:40,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:52:40,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,433 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-24 18:52:40,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:52:40,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:52:40,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:52:40,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:52:40,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (1/1) ... [2024-10-24 18:52:40,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:52:40,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:52:40,491 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-24 18:52:40,497 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-24 18:52:40,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 18:52:40,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:52:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-24 18:52:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-24 18:52:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:52:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 18:52:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:52:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:52:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-24 18:52:40,547 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-24 18:52:40,548 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 18:52:40,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:52:40,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:52:40,860 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 18:52:40,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:52:41,012 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:52:41,013 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 18:52:41,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:41 BoogieIcfgContainer [2024-10-24 18:52:41,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:52:41,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:52:41,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:52:41,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:52:41,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:52:39" (1/3) ... [2024-10-24 18:52:41,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30156ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:41, skipping insertion in model container [2024-10-24 18:52:41,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:52:40" (2/3) ... [2024-10-24 18:52:41,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30156ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:52:41, skipping insertion in model container [2024-10-24 18:52:41,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:52:41" (3/3) ... [2024-10-24 18:52:41,024 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-24 18:52:41,040 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:52:41,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 18:52:41,040 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 18:52:41,118 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-24 18:52:41,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-10-24 18:52:41,202 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-24 18:52:41,203 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 18:52:41,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-24 18:52:41,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-10-24 18:52:41,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-10-24 18:52:41,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:52:41,231 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;@6c0b3094, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:52:41,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-24 18:52:41,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 18:52:41,251 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-24 18:52:41,251 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 18:52:41,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:41,252 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:41,253 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-24 18:52:41,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 398639909, now seen corresponding path program 1 times [2024-10-24 18:52:41,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:52:41,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680534346] [2024-10-24 18:52:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:41,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:52:41,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:52:41,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 18:52:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:41,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:52:41,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:52:41,527 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-24 18:52:41,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:52:41,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:52:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680534346] [2024-10-24 18:52:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680534346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:52:41,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37992082] [2024-10-24 18:52:41,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:41,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:52:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:52:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:52:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:52:41,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:41,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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-24 18:52:41,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:41,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:41,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:43,780 INFO L124 PetriNetUnfolderBase]: 10045/17521 cut-off events. [2024-10-24 18:52:43,781 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2024-10-24 18:52:43,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32443 conditions, 17521 events. 10045/17521 cut-off events. For 1316/1316 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 143213 event pairs, 2999 based on Foata normal form. 1552/18547 useless extension candidates. Maximal degree in co-relation 29201. Up to 8171 conditions per place. [2024-10-24 18:52:44,015 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 150 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-10-24 18:52:44,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 202 transitions, 849 flow [2024-10-24 18:52:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 18:52:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 18:52:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-10-24 18:52:44,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6364764267990074 [2024-10-24 18:52:44,032 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-10-24 18:52:44,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 202 transitions, 849 flow [2024-10-24 18:52:44,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 799 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-24 18:52:44,069 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 327 flow [2024-10-24 18:52:44,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=75, PETRI_TRANSITIONS=89} [2024-10-24 18:52:44,075 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-10-24 18:52:44,075 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 327 flow [2024-10-24 18:52:44,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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-24 18:52:44,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:44,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:44,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 18:52:44,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:44,277 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-24 18:52:44,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 314440543, now seen corresponding path program 1 times [2024-10-24 18:52:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:52:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499658507] [2024-10-24 18:52:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:44,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:52:44,283 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:52:44,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 18:52:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:44,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:52:44,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:52:44,362 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-24 18:52:44,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:52:44,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:52:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499658507] [2024-10-24 18:52:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499658507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:44,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:52:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831195948] [2024-10-24 18:52:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:44,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:52:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:52:44,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:52:44,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:52:44,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-24 18:52:44,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-24 18:52:44,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:44,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-24 18:52:44,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:44,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 51#L720true, 74#true, 138#true, 11#L16true]) [2024-10-24 18:52:44,965 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 18:52:44,966 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:44,966 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:44,966 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 18:52:45,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, 11#L16true]) [2024-10-24 18:52:45,095 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,095 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,095 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,096 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 51#L720true, 74#true, 138#true, 11#L16true]) [2024-10-24 18:52:45,097 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,097 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 18:52:45,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue, 11#L16true]) [2024-10-24 18:52:45,154 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-24 18:52:45,155 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:45,156 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:45,156 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:45,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 74#true, 138#true, 11#L16true]) [2024-10-24 18:52:45,169 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,169 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,169 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,170 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 51#L720true, 74#true, 11#L16true]) [2024-10-24 18:52:45,195 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-10-24 18:52:45,198 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-24 18:52:45,198 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-24 18:52:45,198 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-24 18:52:45,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 51#L720true, 74#true, 138#true]) [2024-10-24 18:52:45,202 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,202 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,202 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,202 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:45,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-24 18:52:45,301 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,301 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,301 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,301 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 11#L16true]) [2024-10-24 18:52:45,305 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,305 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,305 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,305 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-24 18:52:45,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue]) [2024-10-24 18:52:45,310 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,310 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,310 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,311 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 51#L720true, 74#true, 138#true]) [2024-10-24 18:52:45,311 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,311 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,311 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,312 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:45,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-24 18:52:45,339 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-10-24 18:52:45,340 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-24 18:52:45,340 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-24 18:52:45,340 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-24 18:52:45,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue]) [2024-10-24 18:52:45,347 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:45,347 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:45,347 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:45,347 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:45,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 74#true, 138#true]) [2024-10-24 18:52:45,358 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-24 18:52:45,358 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:45,358 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:45,358 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:45,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true, 11#L16true]) [2024-10-24 18:52:45,373 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,374 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,374 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,374 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 51#L720true, 74#true]) [2024-10-24 18:52:45,381 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,381 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,381 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,382 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-24 18:52:45,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue]) [2024-10-24 18:52:45,403 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,403 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,403 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,403 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true]) [2024-10-24 18:52:45,405 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,405 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,405 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,405 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-24 18:52:45,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue]) [2024-10-24 18:52:45,424 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-10-24 18:52:45,424 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-24 18:52:45,424 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-24 18:52:45,424 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-24 18:52:45,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true]) [2024-10-24 18:52:45,440 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-10-24 18:52:45,440 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-24 18:52:45,440 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-24 18:52:45,440 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-24 18:52:45,468 INFO L124 PetriNetUnfolderBase]: 5365/10511 cut-off events. [2024-10-24 18:52:45,468 INFO L125 PetriNetUnfolderBase]: For 3021/3052 co-relation queries the response was YES. [2024-10-24 18:52:45,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20947 conditions, 10511 events. 5365/10511 cut-off events. For 3021/3052 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 92897 event pairs, 2513 based on Foata normal form. 516/10292 useless extension candidates. Maximal degree in co-relation 16954. Up to 4180 conditions per place. [2024-10-24 18:52:45,562 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-10-24 18:52:45,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 460 flow [2024-10-24 18:52:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:52:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 18:52:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-10-24 18:52:45,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-10-24 18:52:45,566 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 327 flow. Second operand 3 states and 138 transitions. [2024-10-24 18:52:45,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 460 flow [2024-10-24 18:52:45,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:45,596 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 343 flow [2024-10-24 18:52:45,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2024-10-24 18:52:45,597 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-10-24 18:52:45,597 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 343 flow [2024-10-24 18:52:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-24 18:52:45,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:45,598 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:45,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 18:52:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:45,799 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-24 18:52:45,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash 662849265, now seen corresponding path program 2 times [2024-10-24 18:52:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:52:45,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504622004] [2024-10-24 18:52:45,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:52:45,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:45,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:52:45,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:52:45,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 18:52:45,867 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 18:52:45,867 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:52:45,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:52:45,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:52:45,893 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-24 18:52:45,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:52:45,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:52:45,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504622004] [2024-10-24 18:52:45,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504622004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:52:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38990439] [2024-10-24 18:52:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:45,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:52:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:52:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:52:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:52:45,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-24 18:52:45,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 18:52:45,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:45,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-24 18:52:45,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:46,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true, 11#L16true]) [2024-10-24 18:52:46,453 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-24 18:52:46,453 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:46,453 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:46,453 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 18:52:46,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-24 18:52:46,687 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,687 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,688 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,688 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 11#L16true]) [2024-10-24 18:52:46,689 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,690 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,690 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,690 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:46,765 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,765 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,765 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,765 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 18:52:46,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-24 18:52:46,794 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,794 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,795 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,795 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true, 7#L744true]) [2024-10-24 18:52:46,800 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,801 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,801 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,801 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 38#$Ultimate##0true, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:46,859 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,859 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,860 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,860 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:46,860 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,861 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,861 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,861 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 18:52:46,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true, 11#L16true]) [2024-10-24 18:52:46,887 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,887 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,887 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,887 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 7#L744true, 21#writerEXITtrue]) [2024-10-24 18:52:46,890 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,890 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,890 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,890 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 7#L744true]) [2024-10-24 18:52:46,893 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,893 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,894 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,894 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true]) [2024-10-24 18:52:46,898 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,898 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,898 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,898 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 74#true, 138#true, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:46,963 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,963 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,963 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,963 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:46,964 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,964 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,964 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,964 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 18:52:46,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 7#L744true, 21#writerEXITtrue]) [2024-10-24 18:52:46,985 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,985 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,985 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,985 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue]) [2024-10-24 18:52:46,988 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,988 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,988 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,988 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true]) [2024-10-24 18:52:46,990 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,991 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,991 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:46,991 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:47,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 74#true, 138#true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,054 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-24 18:52:47,054 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:47,054 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:47,055 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 18:52:47,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 74#true, 7#L744true]) [2024-10-24 18:52:47,077 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,077 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,077 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,077 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue]) [2024-10-24 18:52:47,078 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,078 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,078 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,078 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 18:52:47,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 74#true]) [2024-10-24 18:52:47,162 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,163 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,163 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,163 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 17#L752-4true, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,302 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,302 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,303 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 18:52:47,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 10#writerEXITtrue, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,351 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,353 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,353 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,353 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,353 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 18:52:47,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 74#true, 138#true, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,388 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,388 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,388 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,388 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 10#writerEXITtrue, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,388 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,388 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,389 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,389 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 18:52:47,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 74#true, 138#true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-24 18:52:47,422 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-24 18:52:47,422 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 18:52:47,422 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 18:52:47,422 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 18:52:47,468 INFO L124 PetriNetUnfolderBase]: 8042/15922 cut-off events. [2024-10-24 18:52:47,469 INFO L125 PetriNetUnfolderBase]: For 8442/8498 co-relation queries the response was YES. [2024-10-24 18:52:47,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33624 conditions, 15922 events. 8042/15922 cut-off events. For 8442/8498 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 149975 event pairs, 2470 based on Foata normal form. 224/15335 useless extension candidates. Maximal degree in co-relation 27362. Up to 5206 conditions per place. [2024-10-24 18:52:47,609 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 59 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-10-24 18:52:47,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 606 flow [2024-10-24 18:52:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:52:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 18:52:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-24 18:52:47,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-10-24 18:52:47,611 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 343 flow. Second operand 4 states and 192 transitions. [2024-10-24 18:52:47,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 606 flow [2024-10-24 18:52:47,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 18:52:47,670 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 418 flow [2024-10-24 18:52:47,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2024-10-24 18:52:47,671 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-10-24 18:52:47,671 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 418 flow [2024-10-24 18:52:47,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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-24 18:52:47,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:47,672 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:47,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 18:52:47,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:47,873 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-24 18:52:47,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1660473643, now seen corresponding path program 1 times [2024-10-24 18:52:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:52:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645042900] [2024-10-24 18:52:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:47,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:47,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:52:47,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:52:47,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 18:52:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:47,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:52:47,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:52:48,017 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-24 18:52:48,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:52:48,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:52:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645042900] [2024-10-24 18:52:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645042900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:48,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:52:48,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967751930] [2024-10-24 18:52:48,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:52:48,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:52:48,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:52:48,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:52:48,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:48,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 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-24 18:52:48,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:48,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:48,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:51,354 INFO L124 PetriNetUnfolderBase]: 22936/39577 cut-off events. [2024-10-24 18:52:51,354 INFO L125 PetriNetUnfolderBase]: For 27767/27887 co-relation queries the response was YES. [2024-10-24 18:52:51,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93161 conditions, 39577 events. 22936/39577 cut-off events. For 27767/27887 co-relation queries the response was YES. Maximal size of possible extension queue 2259. Compared 363815 event pairs, 5973 based on Foata normal form. 559/39079 useless extension candidates. Maximal degree in co-relation 84174. Up to 13825 conditions per place. [2024-10-24 18:52:51,642 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 226 selfloop transitions, 32 changer transitions 0/279 dead transitions. [2024-10-24 18:52:51,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 279 transitions, 1634 flow [2024-10-24 18:52:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 18:52:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 18:52:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 451 transitions. [2024-10-24 18:52:51,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-10-24 18:52:51,644 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 418 flow. Second operand 11 states and 451 transitions. [2024-10-24 18:52:51,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 279 transitions, 1634 flow [2024-10-24 18:52:51,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 279 transitions, 1616 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-24 18:52:51,855 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 566 flow [2024-10-24 18:52:51,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=566, PETRI_PLACES=97, PETRI_TRANSITIONS=111} [2024-10-24 18:52:51,857 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2024-10-24 18:52:51,857 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 566 flow [2024-10-24 18:52:51,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 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-24 18:52:51,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:51,857 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:52:51,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 18:52:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:52,058 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-24 18:52:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:52,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1308458934, now seen corresponding path program 1 times [2024-10-24 18:52:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:52:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935818462] [2024-10-24 18:52:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:52,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:52:52,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:52:52,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 18:52:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:52,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:52:52,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:52:52,238 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-24 18:52:52,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:52:52,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:52:52,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935818462] [2024-10-24 18:52:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935818462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:52,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:52,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:52:52,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261212091] [2024-10-24 18:52:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:52,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:52:52,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:52:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:52:52,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:52:52,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:52,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 111 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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-24 18:52:52,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:52,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:52:57,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([228] L744-->readerEXIT: Formula: (and (= (_ bv0 32) |v_readerThread1of1ForFork2_#res#1.offset_1|) (= |v_readerThread1of1ForFork2_#res#1.base_1| (_ bv0 32))) InVars {} OutVars{readerThread1of1ForFork2_#res#1.base=|v_readerThread1of1ForFork2_#res#1.base_1|, readerThread1of1ForFork2_#res#1.offset=|v_readerThread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_#res#1.offset, readerThread1of1ForFork2_#res#1.base][284], [368#(and (= (_ bv0 32) |readerThread1of1ForFork1_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork1_~lx~0#1|)), Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 300#(and (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|)), 187#true, Black: 211#(= ~r~0 (_ bv1 32)), 10#writerEXITtrue, 74#true, 7#L744true, 13#readerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32)), Black: 298#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|)), Black: 303#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 (_ bv3 32))), Black: 294#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32))), Black: 274#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= ~x~0 (_ bv3 32))), Black: 296#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32))), Black: 306#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|))]) [2024-10-24 18:52:57,198 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 18:52:57,198 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:57,198 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:57,198 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 18:52:57,219 INFO L124 PetriNetUnfolderBase]: 34967/58050 cut-off events. [2024-10-24 18:52:57,219 INFO L125 PetriNetUnfolderBase]: For 66113/67929 co-relation queries the response was YES. [2024-10-24 18:52:57,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146170 conditions, 58050 events. 34967/58050 cut-off events. For 66113/67929 co-relation queries the response was YES. Maximal size of possible extension queue 3173. Compared 532623 event pairs, 17574 based on Foata normal form. 1045/56147 useless extension candidates. Maximal degree in co-relation 125678. Up to 35520 conditions per place. [2024-10-24 18:52:57,713 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 156 selfloop transitions, 107 changer transitions 0/299 dead transitions. [2024-10-24 18:52:57,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 299 transitions, 2074 flow [2024-10-24 18:52:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 18:52:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-24 18:52:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 466 transitions. [2024-10-24 18:52:57,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5781637717121588 [2024-10-24 18:52:57,716 INFO L175 Difference]: Start difference. First operand has 97 places, 111 transitions, 566 flow. Second operand 13 states and 466 transitions. [2024-10-24 18:52:57,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 299 transitions, 2074 flow [2024-10-24 18:52:58,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 299 transitions, 1972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-24 18:52:58,490 INFO L231 Difference]: Finished difference. Result has 116 places, 194 transitions, 1368 flow [2024-10-24 18:52:58,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1368, PETRI_PLACES=116, PETRI_TRANSITIONS=194} [2024-10-24 18:52:58,492 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 50 predicate places. [2024-10-24 18:52:58,492 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 194 transitions, 1368 flow [2024-10-24 18:52:58,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 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-24 18:52:58,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:52:58,493 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-24 18:52:58,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:52:58,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:58,694 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-24 18:52:58,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:52:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1734772438, now seen corresponding path program 1 times [2024-10-24 18:52:58,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:52:58,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490093080] [2024-10-24 18:52:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:52:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:52:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:52:58,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:52:58,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 18:52:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:52:58,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:52:58,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:52:58,828 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-24 18:52:58,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:52:58,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:52:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490093080] [2024-10-24 18:52:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490093080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:52:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:52:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 18:52:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715999508] [2024-10-24 18:52:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:52:58,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:52:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:52:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:52:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:52:58,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:52:58,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 194 transitions, 1368 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 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-24 18:52:58,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:52:58,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:52:58,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:53:07,674 INFO L124 PetriNetUnfolderBase]: 54474/91564 cut-off events. [2024-10-24 18:53:07,674 INFO L125 PetriNetUnfolderBase]: For 119080/121088 co-relation queries the response was YES. [2024-10-24 18:53:08,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246637 conditions, 91564 events. 54474/91564 cut-off events. For 119080/121088 co-relation queries the response was YES. Maximal size of possible extension queue 5284. Compared 913072 event pairs, 17416 based on Foata normal form. 2569/91891 useless extension candidates. Maximal degree in co-relation 229339. Up to 39563 conditions per place. [2024-10-24 18:53:08,581 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 240 selfloop transitions, 110 changer transitions 0/386 dead transitions. [2024-10-24 18:53:08,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 386 transitions, 2968 flow [2024-10-24 18:53:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 18:53:08,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 18:53:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2024-10-24 18:53:08,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6495601173020528 [2024-10-24 18:53:08,583 INFO L175 Difference]: Start difference. First operand has 116 places, 194 transitions, 1368 flow. Second operand 11 states and 443 transitions. [2024-10-24 18:53:08,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 386 transitions, 2968 flow [2024-10-24 18:53:10,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 386 transitions, 2962 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-24 18:53:10,804 INFO L231 Difference]: Finished difference. Result has 132 places, 217 transitions, 1806 flow [2024-10-24 18:53:10,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1806, PETRI_PLACES=132, PETRI_TRANSITIONS=217} [2024-10-24 18:53:10,805 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-10-24 18:53:10,805 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 1806 flow [2024-10-24 18:53:10,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 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-24 18:53:10,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 18:53:10,806 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-24 18:53:10,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 18:53:11,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:53:11,009 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-24 18:53:11,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:53:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -336258438, now seen corresponding path program 1 times [2024-10-24 18:53:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:53:11,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312359463] [2024-10-24 18:53:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:53:11,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:53:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:53:11,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:53:11,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 18:53:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:53:11,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:53:11,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:53:11,242 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-24 18:53:11,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:53:11,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:53:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312359463] [2024-10-24 18:53:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312359463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:53:11,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:53:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 18:53:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757125253] [2024-10-24 18:53:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:53:11,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 18:53:11,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:53:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 18:53:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 18:53:11,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-24 18:53:11,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 217 transitions, 1806 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 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-24 18:53:11,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 18:53:11,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-24 18:53:11,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 18:53:22,810 INFO L124 PetriNetUnfolderBase]: 59179/100345 cut-off events. [2024-10-24 18:53:22,810 INFO L125 PetriNetUnfolderBase]: For 170982/172212 co-relation queries the response was YES. [2024-10-24 18:53:23,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289002 conditions, 100345 events. 59179/100345 cut-off events. For 170982/172212 co-relation queries the response was YES. Maximal size of possible extension queue 5761. Compared 1023846 event pairs, 32693 based on Foata normal form. 1401/99630 useless extension candidates. Maximal degree in co-relation 262452. Up to 73342 conditions per place. [2024-10-24 18:53:23,926 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 164 selfloop transitions, 134 changer transitions 0/334 dead transitions. [2024-10-24 18:53:23,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 334 transitions, 3057 flow [2024-10-24 18:53:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 18:53:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 18:53:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 401 transitions. [2024-10-24 18:53:23,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5879765395894428 [2024-10-24 18:53:23,929 INFO L175 Difference]: Start difference. First operand has 132 places, 217 transitions, 1806 flow. Second operand 11 states and 401 transitions. [2024-10-24 18:53:23,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 334 transitions, 3057 flow