./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:24:21,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:24:21,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:24:21,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:24:21,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:24:21,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:24:21,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:24:21,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:24:21,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:24:21,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:24:21,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:24:21,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:24:21,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:24:21,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:24:21,917 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:24:21,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:24:21,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:24:21,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:24:21,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:24:21,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:24:21,921 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:24:21,921 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:24:21,922 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:24:21,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:24:21,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:24:21,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:24:21,923 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:24:21,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:24:21,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:24:21,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:24:21,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:24:21,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:24:21,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:24:21,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:24:21,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:24:21,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:24:21,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:24:21,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:24:21,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:24:21,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:24:21,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:24:21,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:24:21,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-10-14 19:24:22,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:24:22,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:24:22,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:24:22,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:24:22,196 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:24:22,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-14 19:24:23,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:24:23,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:24:23,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-14 19:24:23,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4adcb08/974d380f6b044240bd665e2a4937962a/FLAGf74d1f015 [2024-10-14 19:24:23,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4adcb08/974d380f6b044240bd665e2a4937962a [2024-10-14 19:24:23,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:24:23,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:24:23,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:24:23,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:24:23,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:24:23,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:24:23" (1/1) ... [2024-10-14 19:24:23,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff93905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:23, skipping insertion in model container [2024-10-14 19:24:23,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:24:23" (1/1) ... [2024-10-14 19:24:23,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:24:24,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:24:24,317 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:24:24,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:24:24,415 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:24:24,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24 WrapperNode [2024-10-14 19:24:24,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:24:24,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:24:24,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:24:24,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:24:24,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,471 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2024-10-14 19:24:24,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:24:24,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:24:24,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:24:24,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:24:24,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,504 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 19:24:24,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:24:24,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:24:24,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:24:24,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:24:24,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (1/1) ... [2024-10-14 19:24:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:24:24,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:24:24,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:24:24,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:24:24,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:24:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:24:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-14 19:24:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-14 19:24:24,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 19:24:24,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:24:24,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:24:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:24:24,608 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-14 19:24:24,608 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-14 19:24:24,610 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:24:24,717 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:24:24,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:24:24,892 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:24:24,892 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:24:24,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:24:24,983 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:24:24,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:24 BoogieIcfgContainer [2024-10-14 19:24:24,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:24:24,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:24:24,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:24:24,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:24:24,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:24:23" (1/3) ... [2024-10-14 19:24:24,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd5a984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:24:24, skipping insertion in model container [2024-10-14 19:24:24,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:24" (2/3) ... [2024-10-14 19:24:24,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd5a984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:24:24, skipping insertion in model container [2024-10-14 19:24:24,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:24" (3/3) ... [2024-10-14 19:24:24,993 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-14 19:24:25,011 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:24:25,012 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 19:24:25,012 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:24:25,073 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-14 19:24:25,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-10-14 19:24:25,135 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-14 19:24:25,135 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 19:24:25,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-14 19:24:25,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-10-14 19:24:25,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-10-14 19:24:25,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:24:25,166 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;@71566d44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:24:25,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 19:24:25,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:24:25,187 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-14 19:24:25,187 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 19:24:25,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:25,188 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:25,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 636066479, now seen corresponding path program 1 times [2024-10-14 19:24:25,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:25,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728424099] [2024-10-14 19:24:25,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:25,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:25,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728424099] [2024-10-14 19:24:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728424099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:25,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122311025] [2024-10-14 19:24:25,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:25,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:25,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:25,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:25,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:25,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:25,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:28,178 INFO L124 PetriNetUnfolderBase]: 14102/24421 cut-off events. [2024-10-14 19:24:28,178 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2024-10-14 19:24:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45384 conditions, 24421 events. 14102/24421 cut-off events. For 2090/2090 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 210247 event pairs, 1527 based on Foata normal form. 2538/26333 useless extension candidates. Maximal degree in co-relation 40085. Up to 6266 conditions per place. [2024-10-14 19:24:28,456 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2024-10-14 19:24:28,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2024-10-14 19:24:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 19:24:28,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 19:24:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2024-10-14 19:24:28,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2024-10-14 19:24:28,478 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2024-10-14 19:24:28,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2024-10-14 19:24:28,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-14 19:24:28,530 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2024-10-14 19:24:28,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2024-10-14 19:24:28,537 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-10-14 19:24:28,538 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2024-10-14 19:24:28,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:28,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:28,539 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:24:28,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:28,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash 300194929, now seen corresponding path program 1 times [2024-10-14 19:24:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599361569] [2024-10-14 19:24:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:28,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599361569] [2024-10-14 19:24:28,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599361569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:28,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:28,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:24:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694632162] [2024-10-14 19:24:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:28,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:24:28,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:24:28,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:24:28,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-14 19:24:28,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:28,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:28,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-14 19:24:28,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:29,935 INFO L124 PetriNetUnfolderBase]: 6834/13886 cut-off events. [2024-10-14 19:24:29,936 INFO L125 PetriNetUnfolderBase]: For 4976/5295 co-relation queries the response was YES. [2024-10-14 19:24:30,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28294 conditions, 13886 events. 6834/13886 cut-off events. For 4976/5295 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 134465 event pairs, 2739 based on Foata normal form. 717/13669 useless extension candidates. Maximal degree in co-relation 22139. Up to 5307 conditions per place. [2024-10-14 19:24:30,163 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2024-10-14 19:24:30,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2024-10-14 19:24:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:24:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:24:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-10-14 19:24:30,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-10-14 19:24:30,166 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2024-10-14 19:24:30,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2024-10-14 19:24:30,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:30,256 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2024-10-14 19:24:30,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2024-10-14 19:24:30,257 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-10-14 19:24:30,258 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2024-10-14 19:24:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:30,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:30,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:30,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 19:24:30,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:30,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1645647337, now seen corresponding path program 2 times [2024-10-14 19:24:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:30,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023030155] [2024-10-14 19:24:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023030155] [2024-10-14 19:24:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023030155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:30,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:24:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736612559] [2024-10-14 19:24:30,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:30,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:24:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:24:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:24:30,376 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-14 19:24:30,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:30,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:30,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-14 19:24:30,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:31,401 INFO L124 PetriNetUnfolderBase]: 6316/12591 cut-off events. [2024-10-14 19:24:31,401 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2024-10-14 19:24:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27257 conditions, 12591 events. 6316/12591 cut-off events. For 6176/6368 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 113465 event pairs, 1680 based on Foata normal form. 318/12552 useless extension candidates. Maximal degree in co-relation 24216. Up to 3792 conditions per place. [2024-10-14 19:24:31,501 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-10-14 19:24:31,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 632 flow [2024-10-14 19:24:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:24:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:24:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-14 19:24:31,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-10-14 19:24:31,503 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 192 transitions. [2024-10-14 19:24:31,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 632 flow [2024-10-14 19:24:31,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:24:31,715 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2024-10-14 19:24:31,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2024-10-14 19:24:31,720 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-10-14 19:24:31,720 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2024-10-14 19:24:31,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:31,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:31,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:24:31,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -763757256, now seen corresponding path program 1 times [2024-10-14 19:24:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248109580] [2024-10-14 19:24:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:31,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248109580] [2024-10-14 19:24:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248109580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:31,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:31,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:31,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586429872] [2024-10-14 19:24:31,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:31,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:31,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:31,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:31,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:31,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:31,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:31,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:31,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:33,771 INFO L124 PetriNetUnfolderBase]: 13472/22783 cut-off events. [2024-10-14 19:24:33,771 INFO L125 PetriNetUnfolderBase]: For 21011/21745 co-relation queries the response was YES. [2024-10-14 19:24:33,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56662 conditions, 22783 events. 13472/22783 cut-off events. For 21011/21745 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 182277 event pairs, 2029 based on Foata normal form. 460/22855 useless extension candidates. Maximal degree in co-relation 52344. Up to 5101 conditions per place. [2024-10-14 19:24:33,944 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 201 selfloop transitions, 70 changer transitions 0/301 dead transitions. [2024-10-14 19:24:33,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 1810 flow [2024-10-14 19:24:33,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 19:24:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 19:24:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2024-10-14 19:24:33,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6253101736972705 [2024-10-14 19:24:33,947 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 504 transitions. [2024-10-14 19:24:33,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 1810 flow [2024-10-14 19:24:34,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 301 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:34,264 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2024-10-14 19:24:34,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1038, PETRI_PLACES=105, PETRI_TRANSITIONS=157} [2024-10-14 19:24:34,266 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-10-14 19:24:34,267 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2024-10-14 19:24:34,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:34,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:34,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 19:24:34,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -911065372, now seen corresponding path program 1 times [2024-10-14 19:24:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339553242] [2024-10-14 19:24:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339553242] [2024-10-14 19:24:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339553242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:34,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366404050] [2024-10-14 19:24:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:34,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:34,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:34,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:34,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:34,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 157 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:34,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:34,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:34,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:36,941 INFO L124 PetriNetUnfolderBase]: 14310/24144 cut-off events. [2024-10-14 19:24:36,942 INFO L125 PetriNetUnfolderBase]: For 36560/36909 co-relation queries the response was YES. [2024-10-14 19:24:37,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70727 conditions, 24144 events. 14310/24144 cut-off events. For 36560/36909 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 194157 event pairs, 3049 based on Foata normal form. 444/24353 useless extension candidates. Maximal degree in co-relation 66403. Up to 7170 conditions per place. [2024-10-14 19:24:37,099 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 198 selfloop transitions, 87 changer transitions 0/315 dead transitions. [2024-10-14 19:24:37,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 315 transitions, 2346 flow [2024-10-14 19:24:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 19:24:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 19:24:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 484 transitions. [2024-10-14 19:24:37,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004962779156328 [2024-10-14 19:24:37,102 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 484 transitions. [2024-10-14 19:24:37,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 315 transitions, 2346 flow [2024-10-14 19:24:37,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 315 transitions, 2344 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:37,815 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2024-10-14 19:24:37,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1516, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2024-10-14 19:24:37,816 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-10-14 19:24:37,816 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2024-10-14 19:24:37,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:37,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:37,817 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:37,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:24:37,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:37,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1825893142, now seen corresponding path program 1 times [2024-10-14 19:24:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268291291] [2024-10-14 19:24:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:37,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:24:37,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268291291] [2024-10-14 19:24:37,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268291291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:37,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:37,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:37,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214247518] [2024-10-14 19:24:37,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:37,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:24:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:24:37,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:24:37,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:24:37,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:37,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1516 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:37,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:37,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:37,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:40,546 INFO L124 PetriNetUnfolderBase]: 15074/25341 cut-off events. [2024-10-14 19:24:40,546 INFO L125 PetriNetUnfolderBase]: For 55380/55972 co-relation queries the response was YES. [2024-10-14 19:24:40,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78221 conditions, 25341 events. 15074/25341 cut-off events. For 55380/55972 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 202802 event pairs, 2998 based on Foata normal form. 648/25708 useless extension candidates. Maximal degree in co-relation 74131. Up to 7239 conditions per place. [2024-10-14 19:24:40,688 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 212 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2024-10-14 19:24:40,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 2914 flow [2024-10-14 19:24:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 19:24:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 19:24:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2024-10-14 19:24:40,690 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029776674937966 [2024-10-14 19:24:40,690 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 486 transitions. [2024-10-14 19:24:40,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 2914 flow [2024-10-14 19:24:41,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 2900 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-10-14 19:24:41,539 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2024-10-14 19:24:41,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2010, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2024-10-14 19:24:41,540 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2024-10-14 19:24:41,540 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2024-10-14 19:24:41,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:41,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:41,541 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:41,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:24:41,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:41,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -700195909, now seen corresponding path program 1 times [2024-10-14 19:24:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:24:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221846290] [2024-10-14 19:24:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:24:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:24:41,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:24:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:24:41,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:24:41,605 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:24:41,606 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-14 19:24:41,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-14 19:24:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-14 19:24:41,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-14 19:24:41,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-14 19:24:41,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-14 19:24:41,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-14 19:24:41,611 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-14 19:24:41,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:24:41,614 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-14 19:24:41,673 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:24:41,674 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:24:41,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:24:41 BasicIcfg [2024-10-14 19:24:41,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:24:41,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:24:41,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:24:41,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:24:41,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:24" (3/4) ... [2024-10-14 19:24:41,691 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 19:24:41,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:24:41,693 INFO L158 Benchmark]: Toolchain (without parser) took 17792.43ms. Allocated memory was 163.6MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 107.4MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 747.3MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,693 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:24:41,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.02ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 85.2MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.19ms. Allocated memory is still 163.6MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,694 INFO L158 Benchmark]: Boogie Preprocessor took 51.37ms. Allocated memory is still 163.6MB. Free memory was 83.1MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,695 INFO L158 Benchmark]: RCFGBuilder took 459.21ms. Allocated memory was 163.6MB in the beginning and 224.4MB in the end (delta: 60.8MB). Free memory was 81.0MB in the beginning and 184.3MB in the end (delta: -103.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,695 INFO L158 Benchmark]: TraceAbstraction took 16700.72ms. Allocated memory was 224.4MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 184.3MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 760.0MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,696 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 6.3GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:24:41,697 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.17ms. Allocated memory is still 163.6MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.02ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 85.2MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.19ms. Allocated memory is still 163.6MB. Free memory was 85.2MB in the beginning and 83.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.37ms. Allocated memory is still 163.6MB. Free memory was 83.1MB in the beginning and 81.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.21ms. Allocated memory was 163.6MB in the beginning and 224.4MB in the end (delta: 60.8MB). Free memory was 81.0MB in the beginning and 184.3MB in the end (delta: -103.2MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16700.72ms. Allocated memory was 224.4MB in the beginning and 6.3GB in the end (delta: 6.1GB). Free memory was 184.3MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 760.0MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 6.3GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 1.3s 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.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 19:24:41,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:24:44,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:24:44,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:24:44,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:24:44,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:24:44,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:24:44,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:24:44,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:24:44,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:24:44,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:24:44,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:24:44,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:24:44,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:24:44,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:24:44,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:24:44,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:24:44,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:24:44,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:24:44,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:24:44,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:24:44,262 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:24:44,265 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:24:44,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:24:44,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:24:44,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:24:44,266 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:24:44,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:24:44,266 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:24:44,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:24:44,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:24:44,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:24:44,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:24:44,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:24:44,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:24:44,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:24:44,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:24:44,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:24:44,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:24:44,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:24:44,269 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:24:44,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:24:44,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:24:44,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:24:44,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:24:44,271 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:24:44,272 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-10-14 19:24:44,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:24:44,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:24:44,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:24:44,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:24:44,632 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:24:44,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-14 19:24:46,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:24:46,452 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:24:46,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-14 19:24:46,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e745d1f/5ce94c644ffa4694bac9400cbc5304df/FLAG86d56cceb [2024-10-14 19:24:46,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e745d1f/5ce94c644ffa4694bac9400cbc5304df [2024-10-14 19:24:46,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:24:46,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:24:46,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:24:46,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:24:46,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:24:46,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:24:46" (1/1) ... [2024-10-14 19:24:46,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281f101e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:46, skipping insertion in model container [2024-10-14 19:24:46,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:24:46" (1/1) ... [2024-10-14 19:24:46,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:24:47,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:24:47,249 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:24:47,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:24:47,370 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:24:47,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47 WrapperNode [2024-10-14 19:24:47,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:24:47,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:24:47,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:24:47,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:24:47,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,426 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2024-10-14 19:24:47,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:24:47,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:24:47,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:24:47,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:24:47,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 19:24:47,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:24:47,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:24:47,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:24:47,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:24:47,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (1/1) ... [2024-10-14 19:24:47,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:24:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:24:47,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:24:47,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:24:47,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 19:24:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:24:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-14 19:24:47,589 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-14 19:24:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:24:47,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 19:24:47,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:24:47,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:24:47,591 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-14 19:24:47,592 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-14 19:24:47,593 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:24:47,762 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:24:47,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:24:47,942 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:24:47,943 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:24:48,098 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:24:48,098 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 19:24:48,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:48 BoogieIcfgContainer [2024-10-14 19:24:48,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:24:48,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:24:48,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:24:48,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:24:48,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:24:46" (1/3) ... [2024-10-14 19:24:48,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8715a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:24:48, skipping insertion in model container [2024-10-14 19:24:48,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:24:47" (2/3) ... [2024-10-14 19:24:48,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8715a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:24:48, skipping insertion in model container [2024-10-14 19:24:48,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:24:48" (3/3) ... [2024-10-14 19:24:48,112 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-14 19:24:48,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:24:48,126 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 19:24:48,126 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:24:48,197 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-14 19:24:48,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-10-14 19:24:48,287 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-14 19:24:48,287 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 19:24:48,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-10-14 19:24:48,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-10-14 19:24:48,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-10-14 19:24:48,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:24:48,318 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;@1f73cc3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:24:48,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 19:24:48,337 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:24:48,337 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-14 19:24:48,337 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 19:24:48,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:48,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:48,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:48,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:48,346 INFO L85 PathProgramCache]: Analyzing trace with hash 398639909, now seen corresponding path program 1 times [2024-10-14 19:24:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:24:48,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225761667] [2024-10-14 19:24:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:48,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:24:48,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:24:48,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:24:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:48,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:24:48,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:24:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:48,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:24:48,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:24:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225761667] [2024-10-14 19:24:48,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225761667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:48,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:48,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124221420] [2024-10-14 19:24:48,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:48,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:24:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:24:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:24:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:24:48,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:48,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:48,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:48,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:48,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:51,229 INFO L124 PetriNetUnfolderBase]: 10045/17521 cut-off events. [2024-10-14 19:24:51,229 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2024-10-14 19:24:51,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32443 conditions, 17521 events. 10045/17521 cut-off events. For 1316/1316 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 143213 event pairs, 2999 based on Foata normal form. 1552/18547 useless extension candidates. Maximal degree in co-relation 29201. Up to 8171 conditions per place. [2024-10-14 19:24:51,443 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 150 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-10-14 19:24:51,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 202 transitions, 849 flow [2024-10-14 19:24:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 19:24:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 19:24:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-10-14 19:24:51,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6364764267990074 [2024-10-14 19:24:51,460 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-10-14 19:24:51,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 202 transitions, 849 flow [2024-10-14 19:24:51,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 799 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-14 19:24:51,496 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 327 flow [2024-10-14 19:24:51,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=75, PETRI_TRANSITIONS=89} [2024-10-14 19:24:51,502 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-10-14 19:24:51,503 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 327 flow [2024-10-14 19:24:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:51,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:51,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:51,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:24:51,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:51,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:51,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash 314440543, now seen corresponding path program 1 times [2024-10-14 19:24:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:24:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077108552] [2024-10-14 19:24:51,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:51,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:24:51,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:24:51,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:24:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:51,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:24:51,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:24:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:51,803 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:24:51,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:24:51,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077108552] [2024-10-14 19:24:51,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077108552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:51,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:51,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:24:51,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296679240] [2024-10-14 19:24:51,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:51,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:24:51,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:24:51,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:24:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:24:51,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-14 19:24:51,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:51,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:51,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-14 19:24:51,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:52,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 51#L720true, 74#true, 138#true, 11#L16true]) [2024-10-14 19:24:52,293 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-14 19:24:52,293 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 19:24:52,293 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 19:24:52,293 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-14 19:24:52,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, 11#L16true]) [2024-10-14 19:24:52,338 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,339 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,339 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,339 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 51#L720true, 74#true, 138#true, 11#L16true]) [2024-10-14 19:24:52,340 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,340 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,340 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,341 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-14 19:24:52,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][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue, 11#L16true]) [2024-10-14 19:24:52,381 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 19:24:52,382 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 19:24:52,382 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 19:24:52,382 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 19:24:52,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 74#true, 138#true, 11#L16true]) [2024-10-14 19:24:52,395 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,395 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,395 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,395 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 51#L720true, 74#true, 11#L16true]) [2024-10-14 19:24:52,494 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-10-14 19:24:52,494 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 19:24:52,494 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 19:24:52,494 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-14 19:24:52,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 51#L720true, 74#true, 138#true]) [2024-10-14 19:24:52,497 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,498 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,498 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,498 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:52,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-14 19:24:52,525 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 11#L16true]) [2024-10-14 19:24:52,529 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,529 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,529 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,529 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-14 19:24:52,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue]) [2024-10-14 19:24:52,532 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,532 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,532 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,533 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 51#L720true, 74#true, 138#true]) [2024-10-14 19:24:52,533 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,533 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,533 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,533 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:52,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-14 19:24:52,556 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-10-14 19:24:52,557 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-14 19:24:52,557 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-14 19:24:52,557 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-14 19:24:52,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue]) [2024-10-14 19:24:52,563 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:52,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:52,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:52,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:52,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 74#true, 138#true]) [2024-10-14 19:24:52,575 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:52,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:52,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:52,575 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:52,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true, 11#L16true]) [2024-10-14 19:24:52,589 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,589 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,589 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,590 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 51#L720true, 74#true]) [2024-10-14 19:24:52,597 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,597 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,598 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,598 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-14 19:24:52,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue]) [2024-10-14 19:24:52,619 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,619 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,619 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,619 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true]) [2024-10-14 19:24:52,620 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,621 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,621 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,621 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-14 19:24:52,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue]) [2024-10-14 19:24:52,639 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-10-14 19:24:52,639 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-14 19:24:52,640 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-14 19:24:52,640 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-14 19:24:52,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true]) [2024-10-14 19:24:52,654 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-10-14 19:24:52,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-14 19:24:52,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-14 19:24:52,655 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-14 19:24:52,684 INFO L124 PetriNetUnfolderBase]: 5365/10511 cut-off events. [2024-10-14 19:24:52,684 INFO L125 PetriNetUnfolderBase]: For 3021/3052 co-relation queries the response was YES. [2024-10-14 19:24:52,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20947 conditions, 10511 events. 5365/10511 cut-off events. For 3021/3052 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 92897 event pairs, 2513 based on Foata normal form. 516/10292 useless extension candidates. Maximal degree in co-relation 16954. Up to 4180 conditions per place. [2024-10-14 19:24:52,763 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-10-14 19:24:52,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 460 flow [2024-10-14 19:24:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:24:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:24:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-10-14 19:24:52,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-10-14 19:24:52,765 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 327 flow. Second operand 3 states and 138 transitions. [2024-10-14 19:24:52,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 460 flow [2024-10-14 19:24:52,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:52,795 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 343 flow [2024-10-14 19:24:52,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2024-10-14 19:24:52,796 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-10-14 19:24:52,796 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 343 flow [2024-10-14 19:24:52,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:52,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:52,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:52,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:24:52,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:52,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:53,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash 662849265, now seen corresponding path program 2 times [2024-10-14 19:24:53,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:24:53,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137057670] [2024-10-14 19:24:53,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:24:53,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:53,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:24:53,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:24:53,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:24:53,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 19:24:53,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:24:53,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:24:53,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:24:53,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:53,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:24:53,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:24:53,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137057670] [2024-10-14 19:24:53,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137057670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:53,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:53,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:24:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845194595] [2024-10-14 19:24:53,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:53,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:24:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:24:53,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:24:53,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:24:53,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-14 19:24:53,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:53,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:53,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-14 19:24:53,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:53,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true, 11#L16true]) [2024-10-14 19:24:53,867 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-14 19:24:53,871 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 19:24:53,871 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 19:24:53,871 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-14 19:24:53,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-14 19:24:53,930 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,930 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,930 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,931 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 11#L16true]) [2024-10-14 19:24:53,931 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,932 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,932 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,932 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:53,973 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,973 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,973 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,973 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-14 19:24:53,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue, 11#L16true]) [2024-10-14 19:24:53,992 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,992 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,993 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true, 7#L744true]) [2024-10-14 19:24:53,996 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,997 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,997 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:53,997 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 38#$Ultimate##0true, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,044 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,044 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,044 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,045 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,046 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,046 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,046 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,046 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-14 19:24:54,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true, 11#L16true]) [2024-10-14 19:24:54,066 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,066 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,066 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,067 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 7#L744true, 21#writerEXITtrue]) [2024-10-14 19:24:54,068 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,068 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,069 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,069 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 7#L744true]) [2024-10-14 19:24:54,071 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,071 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,071 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,071 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true]) [2024-10-14 19:24:54,074 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,074 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,074 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,074 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 74#true, 138#true, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,121 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,121 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,121 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,121 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,122 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,122 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,122 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,122 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-14 19:24:54,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 7#L744true, 21#writerEXITtrue]) [2024-10-14 19:24:54,139 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,139 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,139 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,139 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue]) [2024-10-14 19:24:54,141 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,141 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,141 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,141 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true]) [2024-10-14 19:24:54,143 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,143 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,143 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,143 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 74#true, 138#true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,185 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,185 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,185 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,185 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-14 19:24:54,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 74#true, 7#L744true]) [2024-10-14 19:24:54,198 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,198 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,198 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,198 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue]) [2024-10-14 19:24:54,199 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,199 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,199 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,199 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-14 19:24:54,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 74#true]) [2024-10-14 19:24:54,265 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,265 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,265 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,265 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 17#L752-4true, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,285 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,285 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,286 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,286 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-14 19:24:54,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 10#writerEXITtrue, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,453 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,453 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,453 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,454 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,455 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,455 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,455 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,456 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-14 19:24:54,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 74#true, 138#true, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,485 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,485 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,486 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,486 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 10#writerEXITtrue, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,486 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,486 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,487 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,487 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-14 19:24:54,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 74#true, 138#true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-10-14 19:24:54,510 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-14 19:24:54,510 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 19:24:54,510 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 19:24:54,510 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-14 19:24:54,547 INFO L124 PetriNetUnfolderBase]: 8042/15922 cut-off events. [2024-10-14 19:24:54,547 INFO L125 PetriNetUnfolderBase]: For 8442/8498 co-relation queries the response was YES. [2024-10-14 19:24:54,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33624 conditions, 15922 events. 8042/15922 cut-off events. For 8442/8498 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 149975 event pairs, 2470 based on Foata normal form. 224/15335 useless extension candidates. Maximal degree in co-relation 27362. Up to 5206 conditions per place. [2024-10-14 19:24:54,663 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 59 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-10-14 19:24:54,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 606 flow [2024-10-14 19:24:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:24:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:24:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-14 19:24:54,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-10-14 19:24:54,665 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 343 flow. Second operand 4 states and 192 transitions. [2024-10-14 19:24:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 606 flow [2024-10-14 19:24:54,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:24:54,744 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 418 flow [2024-10-14 19:24:54,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2024-10-14 19:24:54,745 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-10-14 19:24:54,745 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 418 flow [2024-10-14 19:24:54,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:54,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:54,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:54,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:24:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:54,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1660473643, now seen corresponding path program 1 times [2024-10-14 19:24:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:24:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057148225] [2024-10-14 19:24:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:54,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:54,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:24:54,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:24:54,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:24:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:55,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:24:55,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:24:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:55,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:24:55,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:24:55,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057148225] [2024-10-14 19:24:55,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057148225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:55,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:55,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:24:55,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661451943] [2024-10-14 19:24:55,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:55,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:24:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:24:55,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:24:55,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:24:55,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:55,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:55,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:55,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:55,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:24:58,161 INFO L124 PetriNetUnfolderBase]: 22936/39577 cut-off events. [2024-10-14 19:24:58,161 INFO L125 PetriNetUnfolderBase]: For 27767/27887 co-relation queries the response was YES. [2024-10-14 19:24:58,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93161 conditions, 39577 events. 22936/39577 cut-off events. For 27767/27887 co-relation queries the response was YES. Maximal size of possible extension queue 2259. Compared 363815 event pairs, 5973 based on Foata normal form. 559/39079 useless extension candidates. Maximal degree in co-relation 84174. Up to 13825 conditions per place. [2024-10-14 19:24:58,471 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 226 selfloop transitions, 32 changer transitions 0/279 dead transitions. [2024-10-14 19:24:58,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 279 transitions, 1634 flow [2024-10-14 19:24:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:24:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:24:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 451 transitions. [2024-10-14 19:24:58,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-10-14 19:24:58,474 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 418 flow. Second operand 11 states and 451 transitions. [2024-10-14 19:24:58,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 279 transitions, 1634 flow [2024-10-14 19:24:58,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 279 transitions, 1616 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-14 19:24:58,748 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 566 flow [2024-10-14 19:24:58,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=566, PETRI_PLACES=97, PETRI_TRANSITIONS=111} [2024-10-14 19:24:58,749 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2024-10-14 19:24:58,750 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 566 flow [2024-10-14 19:24:58,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:58,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:24:58,750 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:24:58,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 19:24:58,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:58,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:24:58,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:24:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1308458934, now seen corresponding path program 1 times [2024-10-14 19:24:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:24:58,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877325666] [2024-10-14 19:24:58,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:24:58,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:24:58,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:24:58,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:24:58,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:24:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:24:59,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:24:59,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:24:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:24:59,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:24:59,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:24:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877325666] [2024-10-14 19:24:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877325666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:24:59,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:24:59,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:24:59,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002963367] [2024-10-14 19:24:59,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:24:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:24:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:24:59,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:24:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:24:59,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:24:59,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 111 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:24:59,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:24:59,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:24:59,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:25:03,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([228] L744-->readerEXIT: Formula: (and (= (_ bv0 32) |v_readerThread1of1ForFork2_#res#1.offset_1|) (= |v_readerThread1of1ForFork2_#res#1.base_1| (_ bv0 32))) InVars {} OutVars{readerThread1of1ForFork2_#res#1.base=|v_readerThread1of1ForFork2_#res#1.base_1|, readerThread1of1ForFork2_#res#1.offset=|v_readerThread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_#res#1.offset, readerThread1of1ForFork2_#res#1.base][284], [368#(and (= (_ bv0 32) |readerThread1of1ForFork1_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork1_~lx~0#1|)), Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 300#(and (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|)), 187#true, Black: 211#(= ~r~0 (_ bv1 32)), 10#writerEXITtrue, 74#true, 7#L744true, 13#readerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32)), Black: 298#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|)), Black: 303#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 (_ bv3 32))), Black: 294#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32))), Black: 274#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= ~x~0 (_ bv3 32))), Black: 296#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32))), Black: 306#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|))]) [2024-10-14 19:25:03,789 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-14 19:25:03,789 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-14 19:25:03,789 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-14 19:25:03,789 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-14 19:25:03,810 INFO L124 PetriNetUnfolderBase]: 34967/58050 cut-off events. [2024-10-14 19:25:03,810 INFO L125 PetriNetUnfolderBase]: For 66113/67929 co-relation queries the response was YES. [2024-10-14 19:25:04,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146170 conditions, 58050 events. 34967/58050 cut-off events. For 66113/67929 co-relation queries the response was YES. Maximal size of possible extension queue 3173. Compared 532623 event pairs, 17574 based on Foata normal form. 1045/56147 useless extension candidates. Maximal degree in co-relation 125678. Up to 35520 conditions per place. [2024-10-14 19:25:04,287 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 156 selfloop transitions, 107 changer transitions 0/299 dead transitions. [2024-10-14 19:25:04,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 299 transitions, 2074 flow [2024-10-14 19:25:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 19:25:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-14 19:25:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 466 transitions. [2024-10-14 19:25:04,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5781637717121588 [2024-10-14 19:25:04,292 INFO L175 Difference]: Start difference. First operand has 97 places, 111 transitions, 566 flow. Second operand 13 states and 466 transitions. [2024-10-14 19:25:04,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 299 transitions, 2074 flow [2024-10-14 19:25:05,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 299 transitions, 1972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-14 19:25:05,181 INFO L231 Difference]: Finished difference. Result has 116 places, 194 transitions, 1368 flow [2024-10-14 19:25:05,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1368, PETRI_PLACES=116, PETRI_TRANSITIONS=194} [2024-10-14 19:25:05,182 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 50 predicate places. [2024-10-14 19:25:05,182 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 194 transitions, 1368 flow [2024-10-14 19:25:05,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:25:05,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:25:05,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:25:05,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:25:05,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:25:05,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:25:05,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:25:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1734772438, now seen corresponding path program 1 times [2024-10-14 19:25:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:25:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346643748] [2024-10-14 19:25:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:25:05,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:25:05,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:25:05,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:25:05,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:25:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:25:05,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:25:05,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:25:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:25:05,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:25:05,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:25:05,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346643748] [2024-10-14 19:25:05,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346643748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:25:05,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:25:05,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 19:25:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595059262] [2024-10-14 19:25:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:25:05,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:25:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:25:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:25:05,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:25:05,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:25:05,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 194 transitions, 1368 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:25:05,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:25:05,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:25:05,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:25:14,216 INFO L124 PetriNetUnfolderBase]: 54474/91564 cut-off events. [2024-10-14 19:25:14,217 INFO L125 PetriNetUnfolderBase]: For 119080/121088 co-relation queries the response was YES. [2024-10-14 19:25:14,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246637 conditions, 91564 events. 54474/91564 cut-off events. For 119080/121088 co-relation queries the response was YES. Maximal size of possible extension queue 5284. Compared 913072 event pairs, 17416 based on Foata normal form. 2569/91891 useless extension candidates. Maximal degree in co-relation 229339. Up to 39563 conditions per place. [2024-10-14 19:25:15,428 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 240 selfloop transitions, 110 changer transitions 0/386 dead transitions. [2024-10-14 19:25:15,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 386 transitions, 2968 flow [2024-10-14 19:25:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:25:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:25:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2024-10-14 19:25:15,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6495601173020528 [2024-10-14 19:25:15,432 INFO L175 Difference]: Start difference. First operand has 116 places, 194 transitions, 1368 flow. Second operand 11 states and 443 transitions. [2024-10-14 19:25:15,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 386 transitions, 2968 flow [2024-10-14 19:25:18,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 386 transitions, 2962 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-14 19:25:18,362 INFO L231 Difference]: Finished difference. Result has 132 places, 217 transitions, 1806 flow [2024-10-14 19:25:18,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1806, PETRI_PLACES=132, PETRI_TRANSITIONS=217} [2024-10-14 19:25:18,364 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-10-14 19:25:18,364 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 1806 flow [2024-10-14 19:25:18,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:25:18,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:25:18,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:25:18,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-14 19:25:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:25:18,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:25:18,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:25:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -336258438, now seen corresponding path program 1 times [2024-10-14 19:25:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:25:18,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230744081] [2024-10-14 19:25:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:25:18,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:25:18,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:25:18,569 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:25:18,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:25:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:25:18,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:25:18,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:25:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:25:18,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:25:18,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:25:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230744081] [2024-10-14 19:25:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230744081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:25:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:25:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:25:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393267456] [2024-10-14 19:25:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:25:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:25:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:25:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:25:18,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:25:18,736 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:25:18,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 217 transitions, 1806 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:25:18,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:25:18,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:25:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:25:29,067 INFO L124 PetriNetUnfolderBase]: 59179/100345 cut-off events. [2024-10-14 19:25:29,068 INFO L125 PetriNetUnfolderBase]: For 170982/172212 co-relation queries the response was YES. [2024-10-14 19:25:29,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289002 conditions, 100345 events. 59179/100345 cut-off events. For 170982/172212 co-relation queries the response was YES. Maximal size of possible extension queue 5761. Compared 1023846 event pairs, 32693 based on Foata normal form. 1401/99630 useless extension candidates. Maximal degree in co-relation 262452. Up to 73342 conditions per place. [2024-10-14 19:25:30,145 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 164 selfloop transitions, 134 changer transitions 0/334 dead transitions. [2024-10-14 19:25:30,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 334 transitions, 3057 flow [2024-10-14 19:25:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 19:25:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 19:25:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 401 transitions. [2024-10-14 19:25:30,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5879765395894428 [2024-10-14 19:25:30,148 INFO L175 Difference]: Start difference. First operand has 132 places, 217 transitions, 1806 flow. Second operand 11 states and 401 transitions. [2024-10-14 19:25:30,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 334 transitions, 3057 flow [2024-10-14 19:25:35,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 334 transitions, 2890 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-10-14 19:25:35,435 INFO L231 Difference]: Finished difference. Result has 143 places, 247 transitions, 2257 flow [2024-10-14 19:25:35,436 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-10-14 19:25:35,436 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 77 predicate places. [2024-10-14 19:25:35,437 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 247 transitions, 2257 flow [2024-10-14 19:25:35,437 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-10-14 19:25:35,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:25:35,437 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:25:35,442 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-10-14 19:25:35,638 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-10-14 19:25:35,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-14 19:25:35,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:25:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1647609722, now seen corresponding path program 1 times [2024-10-14 19:25:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:25:35,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090157117] [2024-10-14 19:25:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:25:35,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:25:35,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:25:35,641 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-10-14 19:25:35,642 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-10-14 19:25:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:25:35,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:25:35,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:25:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:25:35,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:25:35,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:25:35,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090157117] [2024-10-14 19:25:35,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090157117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:25:35,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:25:35,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:25:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316290905] [2024-10-14 19:25:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:25:35,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:25:35,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:25:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:25:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:25:35,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-14 19:25:35,930 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-10-14 19:25:35,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:25:35,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-14 19:25:35,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand