./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 10:22:56,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:56,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:22:56,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:56,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:56,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:56,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:56,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:56,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:56,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:56,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:56,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:56,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:56,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:56,683 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:56,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:56,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:56,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:56,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:56,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:56,684 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:56,687 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:56,688 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:56,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:56,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:56,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:56,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:56,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:56,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:56,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:56,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:56,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:56,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:56,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:56,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:56,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:56,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:22:56,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:22:56,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:56,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:56,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:56,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:56,695 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-11-09 10:22:56,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:56,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:56,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:56,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:57,000 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:57,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-09 10:22:58,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:58,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:58,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-09 10:22:58,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcf2ff2a/8ebbfc1a3dd849edb1990dc4216a5124/FLAG4b2f318ab [2024-11-09 10:22:58,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcf2ff2a/8ebbfc1a3dd849edb1990dc4216a5124 [2024-11-09 10:22:58,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:58,550 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:58,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:58,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:58,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:58,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:58,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af4595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58, skipping insertion in model container [2024-11-09 10:22:58,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:58,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:58,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:58,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:58,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:58,995 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:58,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58 WrapperNode [2024-11-09 10:22:58,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:58,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:58,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:59,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:59,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,040 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2024-11-09 10:22:59,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:59,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:59,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:59,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:59,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,063 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-11-09 10:22:59,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:59,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:59,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:59,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:59,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (1/1) ... [2024-11-09 10:22:59,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:59,105 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-11-09 10:22:59,109 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-11-09 10:22:59,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-11-09 10:22:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-11-09 10:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:59,142 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-11-09 10:22:59,142 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-11-09 10:22:59,143 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:22:59,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:59,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:59,389 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:59,389 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:59,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:59,474 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:22:59,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:59 BoogieIcfgContainer [2024-11-09 10:22:59,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:59,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:59,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:59,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:59,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:58" (1/3) ... [2024-11-09 10:22:59,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b65e0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:59, skipping insertion in model container [2024-11-09 10:22:59,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:58" (2/3) ... [2024-11-09 10:22:59,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b65e0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:59, skipping insertion in model container [2024-11-09 10:22:59,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:59" (3/3) ... [2024-11-09 10:22:59,481 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-11-09 10:22:59,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:59,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:22:59,494 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:59,557 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:22:59,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-11-09 10:22:59,621 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-09 10:22:59,622 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:22:59,626 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-11-09 10:22:59,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-11-09 10:22:59,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-11-09 10:22:59,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:59,644 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;@48160ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:59,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:22:59,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:59,654 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-11-09 10:22:59,654 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:22:59,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:59,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:59,655 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-11-09 10:22:59,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 636066479, now seen corresponding path program 1 times [2024-11-09 10:22:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155778292] [2024-11-09 10:22:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155778292] [2024-11-09 10:22:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155778292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:59,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:59,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:22:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111400820] [2024-11-09 10:22:59,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:59,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:22:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:22:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:23:00,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:00,052 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-11-09 10:23:00,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:00,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:00,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:02,198 INFO L124 PetriNetUnfolderBase]: 14102/24421 cut-off events. [2024-11-09 10:23:02,198 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2024-11-09 10:23:02,272 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-11-09 10:23:02,379 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2024-11-09 10:23:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2024-11-09 10:23:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:23:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:23:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2024-11-09 10:23:02,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2024-11-09 10:23:02,398 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2024-11-09 10:23:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2024-11-09 10:23:02,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:23:02,423 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2024-11-09 10:23:02,426 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-11-09 10:23:02,430 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-11-09 10:23:02,430 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2024-11-09 10:23:02,430 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-11-09 10:23:02,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:02,431 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:02,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:23:02,431 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-11-09 10:23:02,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash 300194929, now seen corresponding path program 1 times [2024-11-09 10:23:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:02,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761558640] [2024-11-09 10:23:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:02,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:02,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761558640] [2024-11-09 10:23:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761558640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834277968] [2024-11-09 10:23:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:02,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:02,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-09 10:23:02,528 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-11-09 10:23:02,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:02,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-09 10:23:02,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:03,563 INFO L124 PetriNetUnfolderBase]: 6834/13886 cut-off events. [2024-11-09 10:23:03,563 INFO L125 PetriNetUnfolderBase]: For 4976/5295 co-relation queries the response was YES. [2024-11-09 10:23:03,600 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-11-09 10:23:03,653 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2024-11-09 10:23:03,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2024-11-09 10:23:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-09 10:23:03,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-11-09 10:23:03,655 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2024-11-09 10:23:03,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2024-11-09 10:23:03,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:23:03,738 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2024-11-09 10:23:03,738 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-11-09 10:23:03,739 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-11-09 10:23:03,739 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2024-11-09 10:23:03,740 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-11-09 10:23:03,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:03,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:03,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:23:03,741 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-11-09 10:23:03,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1645647337, now seen corresponding path program 2 times [2024-11-09 10:23:03,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:03,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780097714] [2024-11-09 10:23:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:03,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780097714] [2024-11-09 10:23:03,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780097714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:03,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:03,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013848129] [2024-11-09 10:23:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:03,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:23:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:03,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:23:03,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:23:03,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-09 10:23:03,813 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-11-09 10:23:03,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:03,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-09 10:23:03,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:04,581 INFO L124 PetriNetUnfolderBase]: 6316/12591 cut-off events. [2024-11-09 10:23:04,581 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2024-11-09 10:23:04,603 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-11-09 10:23:04,639 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-11-09 10:23:04,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 632 flow [2024-11-09 10:23:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:23:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:23:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-09 10:23:04,641 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-11-09 10:23:04,641 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 192 transitions. [2024-11-09 10:23:04,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 632 flow [2024-11-09 10:23:04,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:04,716 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2024-11-09 10:23:04,716 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-11-09 10:23:04,717 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-11-09 10:23:04,718 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2024-11-09 10:23:04,718 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-11-09 10:23:04,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:04,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:23:04,719 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-11-09 10:23:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -763757256, now seen corresponding path program 1 times [2024-11-09 10:23:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216355617] [2024-11-09 10:23:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216355617] [2024-11-09 10:23:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216355617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:23:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889449719] [2024-11-09 10:23:04,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:04,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:23:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:23:04,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:23:04,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:04,828 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-11-09 10:23:04,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:04,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:04,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:06,430 INFO L124 PetriNetUnfolderBase]: 13472/22783 cut-off events. [2024-11-09 10:23:06,431 INFO L125 PetriNetUnfolderBase]: For 21011/21745 co-relation queries the response was YES. [2024-11-09 10:23:06,516 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-11-09 10:23:06,741 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 201 selfloop transitions, 70 changer transitions 0/301 dead transitions. [2024-11-09 10:23:06,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 1810 flow [2024-11-09 10:23:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:23:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:23:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2024-11-09 10:23:06,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6253101736972705 [2024-11-09 10:23:06,744 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 504 transitions. [2024-11-09 10:23:06,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 1810 flow [2024-11-09 10:23:06,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 301 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:23:06,973 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2024-11-09 10:23:06,974 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-11-09 10:23:06,974 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-11-09 10:23:06,974 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2024-11-09 10:23:06,975 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-11-09 10:23:06,975 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:06,975 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-11-09 10:23:06,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:23:06,975 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-11-09 10:23:06,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash -911065372, now seen corresponding path program 1 times [2024-11-09 10:23:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452306474] [2024-11-09 10:23:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:07,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452306474] [2024-11-09 10:23:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452306474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:07,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:07,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:23:07,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570813368] [2024-11-09 10:23:07,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:07,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:23:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:07,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:23:07,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:23:07,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:07,076 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-11-09 10:23:07,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:07,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:09,132 INFO L124 PetriNetUnfolderBase]: 14310/24144 cut-off events. [2024-11-09 10:23:09,132 INFO L125 PetriNetUnfolderBase]: For 36560/36909 co-relation queries the response was YES. [2024-11-09 10:23:09,212 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-11-09 10:23:09,298 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 198 selfloop transitions, 87 changer transitions 0/315 dead transitions. [2024-11-09 10:23:09,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 315 transitions, 2346 flow [2024-11-09 10:23:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:23:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:23:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 484 transitions. [2024-11-09 10:23:09,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004962779156328 [2024-11-09 10:23:09,301 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 484 transitions. [2024-11-09 10:23:09,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 315 transitions, 2346 flow [2024-11-09 10:23:10,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 315 transitions, 2344 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-09 10:23:10,051 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2024-11-09 10:23:10,051 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-11-09 10:23:10,052 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-11-09 10:23:10,052 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2024-11-09 10:23:10,053 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-11-09 10:23:10,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:10,053 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-11-09 10:23:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:23:10,053 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-11-09 10:23:10,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1825893142, now seen corresponding path program 1 times [2024-11-09 10:23:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073309697] [2024-11-09 10:23:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:23:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073309697] [2024-11-09 10:23:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073309697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:23:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050889222] [2024-11-09 10:23:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:10,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:23:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:23:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:23:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:23:10,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:10,124 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-11-09 10:23:10,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:10,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:10,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:12,395 INFO L124 PetriNetUnfolderBase]: 15074/25341 cut-off events. [2024-11-09 10:23:12,395 INFO L125 PetriNetUnfolderBase]: For 55380/55972 co-relation queries the response was YES. [2024-11-09 10:23:12,546 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-11-09 10:23:12,632 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 212 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2024-11-09 10:23:12,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 2914 flow [2024-11-09 10:23:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:23:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:23:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2024-11-09 10:23:12,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029776674937966 [2024-11-09 10:23:12,635 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 486 transitions. [2024-11-09 10:23:12,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 2914 flow [2024-11-09 10:23:13,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 2900 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-09 10:23:13,709 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2024-11-09 10:23:13,709 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-11-09 10:23:13,710 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2024-11-09 10:23:13,710 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2024-11-09 10:23:13,710 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-11-09 10:23:13,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:13,710 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-11-09 10:23:13,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:23:13,710 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-11-09 10:23:13,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash -700195909, now seen corresponding path program 1 times [2024-11-09 10:23:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:23:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154774582] [2024-11-09 10:23:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:23:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:23:13,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:23:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:23:13,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:23:13,766 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:23:13,767 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-09 10:23:13,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-09 10:23:13,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-09 10:23:13,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-09 10:23:13,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-09 10:23:13,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-09 10:23:13,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-09 10:23:13,773 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-09 10:23:13,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:23:13,775 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-09 10:23:13,820 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:23:13,821 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:23:13,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:23:13 BasicIcfg [2024-11-09 10:23:13,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:23:13,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:23:13,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:23:13,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:23:13,828 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:59" (3/4) ... [2024-11-09 10:23:13,829 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:23:13,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:23:13,832 INFO L158 Benchmark]: Toolchain (without parser) took 15281.52ms. Allocated memory was 155.2MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 118.6MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 899.8MB. Max. memory is 16.1GB. [2024-11-09 10:23:13,832 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:23:13,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.97ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 96.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:13,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.13ms. Allocated memory is still 155.2MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:13,835 INFO L158 Benchmark]: Boogie Preprocessor took 29.09ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:23:13,835 INFO L158 Benchmark]: RCFGBuilder took 403.70ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 108.1MB in the end (delta: -15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 10:23:13,835 INFO L158 Benchmark]: TraceAbstraction took 14349.60ms. Allocated memory was 155.2MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 107.1MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 890.2MB. Max. memory is 16.1GB. [2024-11-09 10:23:13,835 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 6.9GB. Free memory is still 6.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:23:13,836 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.14ms. Allocated memory is still 104.9MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.97ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 96.6MB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.13ms. Allocated memory is still 155.2MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.09ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 92.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.70ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 108.1MB in the end (delta: -15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14349.60ms. Allocated memory was 155.2MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 107.1MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 890.2MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 6.9GB. Free memory is still 6.0GB. 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: 14.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 1.0s 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.4s 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-11-09 10:23:13,871 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/11.0.12-open/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 ../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-?-c7c6ca5-m [2024-11-09 10:23:16,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:23:16,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:23:16,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:23:16,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:23:16,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:23:16,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:23:16,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:23:16,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:23:16,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:23:16,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:23:16,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:23:16,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:23:16,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:23:16,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:23:16,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:23:16,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:23:16,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:23:16,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:23:16,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:23:16,223 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:23:16,226 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:23:16,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:23:16,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:23:16,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:23:16,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:23:16,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:23:16,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:23:16,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:23:16,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:23:16,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:23:16,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:23:16,229 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:23:16,229 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:23:16,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:23:16,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:23:16,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:23:16,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:23:16,230 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-11-09 10:23:16,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:23:16,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:23:16,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:23:16,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:23:16,567 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:23:16,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-09 10:23:18,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:23:18,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:23:18,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-09 10:23:18,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1061e51/40195b56c13e46eabb60d8588d582349/FLAGd274eec51 [2024-11-09 10:23:18,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b1061e51/40195b56c13e46eabb60d8588d582349 [2024-11-09 10:23:18,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:23:18,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:23:18,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:23:18,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:23:18,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:23:18,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:23:18" (1/1) ... [2024-11-09 10:23:18,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3271be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:18, skipping insertion in model container [2024-11-09 10:23:18,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:23:18" (1/1) ... [2024-11-09 10:23:18,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:23:18,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:23:19,023 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:23:19,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:23:19,098 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:23:19,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19 WrapperNode [2024-11-09 10:23:19,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:23:19,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:23:19,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:23:19,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:23:19,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,147 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2024-11-09 10:23:19,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:23:19,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:23:19,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:23:19,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:23:19,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,175 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-11-09 10:23:19,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:23:19,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:23:19,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:23:19,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:23:19,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (1/1) ... [2024-11-09 10:23:19,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:23:19,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:23:19,232 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-11-09 10:23:19,234 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-11-09 10:23:19,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:23:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:23:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-11-09 10:23:19,273 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-11-09 10:23:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:23:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:23:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:23:19,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:23:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-11-09 10:23:19,274 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-11-09 10:23:19,277 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:23:19,409 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:23:19,411 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:23:19,610 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:23:19,611 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:23:19,718 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:23:19,718 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:23:19,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:19 BoogieIcfgContainer [2024-11-09 10:23:19,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:23:19,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:23:19,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:23:19,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:23:19,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:23:18" (1/3) ... [2024-11-09 10:23:19,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29de4e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:23:19, skipping insertion in model container [2024-11-09 10:23:19,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:23:19" (2/3) ... [2024-11-09 10:23:19,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29de4e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:23:19, skipping insertion in model container [2024-11-09 10:23:19,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:23:19" (3/3) ... [2024-11-09 10:23:19,727 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-11-09 10:23:19,742 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:23:19,743 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 10:23:19,743 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:23:19,815 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:23:19,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-11-09 10:23:19,886 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-09 10:23:19,886 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 10:23:19,890 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-11-09 10:23:19,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-11-09 10:23:19,896 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-11-09 10:23:19,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:23:19,914 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;@2d87db20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:23:19,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-09 10:23:19,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:23:19,930 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-11-09 10:23:19,930 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:23:19,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:19,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:19,931 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-11-09 10:23:19,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 398639909, now seen corresponding path program 1 times [2024-11-09 10:23:19,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425197968] [2024-11-09 10:23:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:19,951 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-11-09 10:23:19,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:19,954 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-11-09 10:23:19,955 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-11-09 10:23:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:20,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:23:20,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:20,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:20,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425197968] [2024-11-09 10:23:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425197968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:23:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856786378] [2024-11-09 10:23:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:23:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:23:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:23:20,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:20,297 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-11-09 10:23:20,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:20,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:20,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:22,060 INFO L124 PetriNetUnfolderBase]: 10045/17521 cut-off events. [2024-11-09 10:23:22,060 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2024-11-09 10:23:22,110 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-11-09 10:23:22,228 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 150 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-11-09 10:23:22,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 202 transitions, 849 flow [2024-11-09 10:23:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:23:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:23:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-11-09 10:23:22,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6364764267990074 [2024-11-09 10:23:22,242 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-11-09 10:23:22,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 202 transitions, 849 flow [2024-11-09 10:23:22,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 799 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:23:22,273 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 327 flow [2024-11-09 10:23:22,276 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-11-09 10:23:22,280 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-11-09 10:23:22,281 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 327 flow [2024-11-09 10:23:22,281 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-11-09 10:23:22,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:22,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:22,287 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-11-09 10:23:22,482 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-11-09 10:23:22,483 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-11-09 10:23:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash 314440543, now seen corresponding path program 1 times [2024-11-09 10:23:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739255276] [2024-11-09 10:23:22,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:22,484 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-11-09 10:23:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:22,487 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-11-09 10:23:22,487 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-11-09 10:23:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:22,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:23:22,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:22,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:22,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739255276] [2024-11-09 10:23:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739255276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:22,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:22,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:22,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933494907] [2024-11-09 10:23:22,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:22,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:23:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:23:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:23:22,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-09 10:23:22,619 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-11-09 10:23:22,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:22,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-09 10:23:22,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:23,065 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-11-09 10:23:23,066 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-09 10:23:23,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-09 10:23:23,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-09 10:23:23,067 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-09 10:23:23,113 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-11-09 10:23:23,114 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,114 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,114 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,114 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,116 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-11-09 10:23:23,116 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,116 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,116 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,117 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-09 10:23:23,212 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-11-09 10:23:23,213 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-09 10:23:23,214 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:23:23,214 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:23:23,216 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:23:23,225 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-11-09 10:23:23,226 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,226 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,226 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,226 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,245 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-11-09 10:23:23,245 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-11-09 10:23:23,245 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-09 10:23:23,245 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-09 10:23:23,245 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-09 10:23:23,247 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-11-09 10:23:23,247 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,247 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,248 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,248 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:23,279 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-11-09 10:23:23,280 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,280 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,280 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,280 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,282 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-11-09 10:23:23,282 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,286 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,286 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,286 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-09 10:23:23,289 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-11-09 10:23:23,289 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,289 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,293 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,293 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,294 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-11-09 10:23:23,294 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,294 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,294 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,294 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:23,315 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-11-09 10:23:23,315 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-11-09 10:23:23,315 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-11-09 10:23:23,315 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-11-09 10:23:23,315 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-11-09 10:23:23,320 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-11-09 10:23:23,320 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:23,320 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:23,320 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:23,320 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:23,327 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-11-09 10:23:23,327 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-09 10:23:23,327 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:23,327 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:23,327 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:23,336 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-11-09 10:23:23,336 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,336 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,336 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,336 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,341 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-11-09 10:23:23,341 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-09 10:23:23,355 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-11-09 10:23:23,356 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,356 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,356 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,356 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,357 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-11-09 10:23:23,357 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,357 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,357 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,357 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-09 10:23:23,369 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-11-09 10:23:23,369 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-11-09 10:23:23,369 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-11-09 10:23:23,369 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-11-09 10:23:23,369 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-11-09 10:23:23,380 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-11-09 10:23:23,380 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-11-09 10:23:23,380 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-11-09 10:23:23,380 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-11-09 10:23:23,380 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-11-09 10:23:23,401 INFO L124 PetriNetUnfolderBase]: 5365/10511 cut-off events. [2024-11-09 10:23:23,401 INFO L125 PetriNetUnfolderBase]: For 3021/3052 co-relation queries the response was YES. [2024-11-09 10:23:23,432 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-11-09 10:23:23,473 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-11-09 10:23:23,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 460 flow [2024-11-09 10:23:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:23:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:23:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-09 10:23:23,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-11-09 10:23:23,474 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 327 flow. Second operand 3 states and 138 transitions. [2024-11-09 10:23:23,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 460 flow [2024-11-09 10:23:23,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:23:23,494 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 343 flow [2024-11-09 10:23:23,494 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-11-09 10:23:23,495 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-11-09 10:23:23,495 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 343 flow [2024-11-09 10:23:23,496 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-11-09 10:23:23,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:23,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:23,505 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-11-09 10:23:23,698 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-11-09 10:23:23,699 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-11-09 10:23:23,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash 662849265, now seen corresponding path program 2 times [2024-11-09 10:23:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300842916] [2024-11-09 10:23:23,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:23:23,700 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-11-09 10:23:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:23,703 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-11-09 10:23:23,765 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-11-09 10:23:23,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:23:23,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:23:23,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:23:23,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:23,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:23,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300842916] [2024-11-09 10:23:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300842916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:23,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:23,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:23:23,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950178382] [2024-11-09 10:23:23,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:23,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:23:23,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:23,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:23:23,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:23:23,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-09 10:23:23,855 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-11-09 10:23:23,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:23,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-09 10:23:23,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:24,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][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-11-09 10:23:24,311 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-09 10:23:24,312 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:23:24,312 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:23:24,312 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-09 10:23:24,356 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-11-09 10:23:24,356 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,356 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,356 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,356 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,357 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-11-09 10:23:24,357 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,357 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,357 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,357 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,397 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-11-09 10:23:24,397 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,397 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,398 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,398 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-09 10:23:24,412 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-11-09 10:23:24,412 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,412 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,412 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,413 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,415 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-11-09 10:23:24,415 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,415 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,415 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,415 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,446 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-11-09 10:23:24,447 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 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-11-09 10:23:24,447 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,447 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-09 10:23:24,462 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-11-09 10:23:24,462 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,462 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,462 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,462 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,463 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-11-09 10:23:24,463 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,463 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,463 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,463 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,464 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-11-09 10:23:24,465 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,465 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,465 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,465 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,466 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-11-09 10:23:24,467 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,467 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,467 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,467 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,500 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-11-09 10:23:24,500 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,500 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,500 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,500 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,501 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-11-09 10:23:24,501 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,501 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,501 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,501 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-09 10:23:24,514 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-11-09 10:23:24,514 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,515 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,515 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,515 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,516 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-11-09 10:23:24,516 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,516 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,516 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,517 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,518 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-11-09 10:23:24,518 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,518 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,555 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-11-09 10:23:24,555 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-09 10:23:24,571 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-11-09 10:23:24,571 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,571 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,571 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,571 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,572 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-11-09 10:23:24,572 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,572 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,572 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,572 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-09 10:23:24,623 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-11-09 10:23:24,623 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,623 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,623 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,623 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,737 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-11-09 10:23:24,738 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,738 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,738 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,738 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-09 10:23:24,796 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-11-09 10:23:24,796 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,796 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,797 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,797 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,798 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-11-09 10:23:24,799 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,799 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,799 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,799 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-09 10:23:24,842 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-11-09 10:23:24,843 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,843 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,843 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,843 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,844 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-11-09 10:23:24,844 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,844 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,844 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,844 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-09 10:23:24,879 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-11-09 10:23:24,880 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-09 10:23:24,880 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 10:23:24,880 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 10:23:24,880 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-09 10:23:24,939 INFO L124 PetriNetUnfolderBase]: 8042/15922 cut-off events. [2024-11-09 10:23:24,939 INFO L125 PetriNetUnfolderBase]: For 8442/8498 co-relation queries the response was YES. [2024-11-09 10:23:25,002 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-11-09 10:23:25,072 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 59 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-11-09 10:23:25,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 606 flow [2024-11-09 10:23:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:23:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:23:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-09 10:23:25,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-11-09 10:23:25,074 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 343 flow. Second operand 4 states and 192 transitions. [2024-11-09 10:23:25,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 606 flow [2024-11-09 10:23:25,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:23:25,123 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 418 flow [2024-11-09 10:23:25,123 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-11-09 10:23:25,124 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-11-09 10:23:25,124 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 418 flow [2024-11-09 10:23:25,124 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-11-09 10:23:25,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:25,124 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:25,132 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:23:25,327 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-11-09 10:23:25,328 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-11-09 10:23:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1660473643, now seen corresponding path program 1 times [2024-11-09 10:23:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809746729] [2024-11-09 10:23:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:25,329 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-11-09 10:23:25,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:25,332 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-11-09 10:23:25,333 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-11-09 10:23:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:25,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:23:25,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:25,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:25,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809746729] [2024-11-09 10:23:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809746729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:25,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:23:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762712663] [2024-11-09 10:23:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:25,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:23:25,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:23:25,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:23:25,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:25,513 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-11-09 10:23:25,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:25,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:25,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:28,410 INFO L124 PetriNetUnfolderBase]: 22936/39577 cut-off events. [2024-11-09 10:23:28,410 INFO L125 PetriNetUnfolderBase]: For 27767/27887 co-relation queries the response was YES. [2024-11-09 10:23:28,616 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-11-09 10:23:28,940 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 226 selfloop transitions, 32 changer transitions 0/279 dead transitions. [2024-11-09 10:23:28,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 279 transitions, 1634 flow [2024-11-09 10:23:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:23:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:23:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 451 transitions. [2024-11-09 10:23:28,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-11-09 10:23:28,942 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 418 flow. Second operand 11 states and 451 transitions. [2024-11-09 10:23:28,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 279 transitions, 1634 flow [2024-11-09 10:23:29,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 279 transitions, 1616 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 10:23:29,104 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 566 flow [2024-11-09 10:23:29,105 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-11-09 10:23:29,105 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2024-11-09 10:23:29,105 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 566 flow [2024-11-09 10:23:29,106 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-11-09 10:23:29,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:29,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:23:29,114 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-11-09 10:23:29,306 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-11-09 10:23:29,307 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-11-09 10:23:29,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1308458934, now seen corresponding path program 1 times [2024-11-09 10:23:29,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:29,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865546241] [2024-11-09 10:23:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:29,308 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-11-09 10:23:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:29,309 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-11-09 10:23:29,310 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-11-09 10:23:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:29,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:23:29,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:29,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:29,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865546241] [2024-11-09 10:23:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865546241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:23:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936945520] [2024-11-09 10:23:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:29,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:23:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:29,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:23:29,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:23:29,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:29,453 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-11-09 10:23:29,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:29,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:29,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:33,645 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-11-09 10:23:33,645 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-09 10:23:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 10:23:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 10:23:33,645 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-09 10:23:33,666 INFO L124 PetriNetUnfolderBase]: 34967/58050 cut-off events. [2024-11-09 10:23:33,667 INFO L125 PetriNetUnfolderBase]: For 66113/67929 co-relation queries the response was YES. [2024-11-09 10:23:34,063 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-11-09 10:23:34,430 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 156 selfloop transitions, 107 changer transitions 0/299 dead transitions. [2024-11-09 10:23:34,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 299 transitions, 2074 flow [2024-11-09 10:23:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:23:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:23:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 466 transitions. [2024-11-09 10:23:34,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5781637717121588 [2024-11-09 10:23:34,432 INFO L175 Difference]: Start difference. First operand has 97 places, 111 transitions, 566 flow. Second operand 13 states and 466 transitions. [2024-11-09 10:23:34,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 299 transitions, 2074 flow [2024-11-09 10:23:35,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 299 transitions, 1972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-09 10:23:35,047 INFO L231 Difference]: Finished difference. Result has 116 places, 194 transitions, 1368 flow [2024-11-09 10:23:35,048 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-11-09 10:23:35,048 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 50 predicate places. [2024-11-09 10:23:35,048 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 194 transitions, 1368 flow [2024-11-09 10:23:35,048 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-11-09 10:23:35,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:35,049 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-11-09 10:23:35,052 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-11-09 10:23:35,252 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-11-09 10:23:35,253 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-11-09 10:23:35,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1734772438, now seen corresponding path program 1 times [2024-11-09 10:23:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94030558] [2024-11-09 10:23:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:35,254 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-11-09 10:23:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:35,258 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-11-09 10:23:35,258 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-11-09 10:23:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:35,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:23:35,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:35,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:35,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94030558] [2024-11-09 10:23:35,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94030558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:35,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:23:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847813004] [2024-11-09 10:23:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:35,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:23:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:23:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:23:35,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:35,417 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-11-09 10:23:35,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:35,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:35,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:43,459 INFO L124 PetriNetUnfolderBase]: 54474/91564 cut-off events. [2024-11-09 10:23:43,459 INFO L125 PetriNetUnfolderBase]: For 119080/121088 co-relation queries the response was YES. [2024-11-09 10:23:44,352 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-11-09 10:23:44,919 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 240 selfloop transitions, 110 changer transitions 0/386 dead transitions. [2024-11-09 10:23:44,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 386 transitions, 2968 flow [2024-11-09 10:23:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:23:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:23:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2024-11-09 10:23:44,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6495601173020528 [2024-11-09 10:23:44,921 INFO L175 Difference]: Start difference. First operand has 116 places, 194 transitions, 1368 flow. Second operand 11 states and 443 transitions. [2024-11-09 10:23:44,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 386 transitions, 2968 flow [2024-11-09 10:23:47,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 386 transitions, 2962 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-09 10:23:47,067 INFO L231 Difference]: Finished difference. Result has 132 places, 217 transitions, 1806 flow [2024-11-09 10:23:47,068 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-11-09 10:23:47,068 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-11-09 10:23:47,068 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 1806 flow [2024-11-09 10:23:47,069 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-11-09 10:23:47,069 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:23:47,069 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-11-09 10:23:47,074 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-11-09 10:23:47,271 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-11-09 10:23:47,272 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-11-09 10:23:47,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:23:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -336258438, now seen corresponding path program 1 times [2024-11-09 10:23:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:23:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862615673] [2024-11-09 10:23:47,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:23:47,273 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-11-09 10:23:47,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:23:47,275 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-11-09 10:23:47,276 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-11-09 10:23:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:23:47,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:23:47,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:23:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:23:47,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:23:47,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:23:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862615673] [2024-11-09 10:23:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862615673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:23:47,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:23:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:23:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263348173] [2024-11-09 10:23:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:23:47,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:23:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:23:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:23:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:23:47,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:23:47,434 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-11-09 10:23:47,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:23:47,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:23:47,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:23:56,871 INFO L124 PetriNetUnfolderBase]: 59179/100345 cut-off events. [2024-11-09 10:23:56,872 INFO L125 PetriNetUnfolderBase]: For 170982/172212 co-relation queries the response was YES. [2024-11-09 10:23:58,016 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-11-09 10:23:58,684 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 164 selfloop transitions, 134 changer transitions 0/334 dead transitions. [2024-11-09 10:23:58,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 334 transitions, 3057 flow [2024-11-09 10:23:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:23:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:23:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 401 transitions. [2024-11-09 10:23:58,686 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5879765395894428 [2024-11-09 10:23:58,686 INFO L175 Difference]: Start difference. First operand has 132 places, 217 transitions, 1806 flow. Second operand 11 states and 401 transitions. [2024-11-09 10:23:58,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 334 transitions, 3057 flow [2024-11-09 10:24:02,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 334 transitions, 2890 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-11-09 10:24:02,392 INFO L231 Difference]: Finished difference. Result has 143 places, 247 transitions, 2257 flow [2024-11-09 10:24:02,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2257, PETRI_PLACES=143, PETRI_TRANSITIONS=247} [2024-11-09 10:24:02,393 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 77 predicate places. [2024-11-09 10:24:02,393 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 247 transitions, 2257 flow [2024-11-09 10:24:02,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-11-09 10:24:02,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:24:02,394 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-11-09 10:24:02,397 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 (8)] Ended with exit code 0 [2024-11-09 10:24:02,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-11-09 10:24:02,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-09 10:24:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:24:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1647609722, now seen corresponding path program 1 times [2024-11-09 10:24:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:24:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900626566] [2024-11-09 10:24:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:24:02,596 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-11-09 10:24:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:24:02,597 INFO L229 MonitoredProcess]: Starting monitored process 9 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-11-09 10:24:02,598 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 (9)] Waiting until timeout for monitored process [2024-11-09 10:24:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:24:02,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:24:02,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:24:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:24:02,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:24:02,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:24:02,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900626566] [2024-11-09 10:24:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900626566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:24:02,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:24:02,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:24:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100847790] [2024-11-09 10:24:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:24:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:24:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:24:02,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:24:02,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:24:02,760 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-09 10:24:02,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 247 transitions, 2257 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-11-09 10:24:02,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:24:02,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-09 10:24:02,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand