./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:09:30,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:09:30,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:09:30,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:09:30,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:09:30,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:09:30,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:09:30,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:09:30,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:09:30,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:09:30,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:09:30,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:09:30,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:09:30,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:09:30,125 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:09:30,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:09:30,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:09:30,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:09:30,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:09:30,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:09:30,127 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:09:30,131 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:09:30,131 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:09:30,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:09:30,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:09:30,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:09:30,132 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:09:30,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:09:30,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:09:30,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:09:30,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:09:30,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:09:30,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:09:30,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:09:30,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:09:30,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:09:30,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:09:30,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:09:30,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:09:30,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:09:30,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:09:30,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:09:30,141 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-13 12:09:30,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:09:30,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:09:30,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:09:30,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:09:30,438 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:09:30,439 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-13 12:09:32,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:09:32,340 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:09:32,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-13 12:09:32,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbe6fa8c/6a867a4af42c47ec9ace6a8ad8743038/FLAG7aee0d2c4 [2024-10-13 12:09:32,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbe6fa8c/6a867a4af42c47ec9ace6a8ad8743038 [2024-10-13 12:09:32,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:09:32,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:09:32,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:09:32,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:09:32,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:09:32,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:32,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbb93dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32, skipping insertion in model container [2024-10-13 12:09:32,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:32,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:09:32,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:09:32,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:09:32,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:09:32,980 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:09:32,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32 WrapperNode [2024-10-13 12:09:32,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:09:32,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:09:32,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:09:32,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:09:32,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,032 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2024-10-13 12:09:33,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:09:33,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:09:33,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:09:33,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:09:33,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,061 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:09:33,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:09:33,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:09:33,079 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:09:33,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:09:33,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (1/1) ... [2024-10-13 12:09:33,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:09:33,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:09:33,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:09:33,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:09:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:09:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:09:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-13 12:09:33,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-13 12:09:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:09:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:09:33,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:09:33,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:09:33,183 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-13 12:09:33,183 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-13 12:09:33,184 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:09:33,337 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:09:33,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:09:33,525 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:09:33,526 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:09:33,647 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:09:33,647 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:09:33,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:33 BoogieIcfgContainer [2024-10-13 12:09:33,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:09:33,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:09:33,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:09:33,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:09:33,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:09:32" (1/3) ... [2024-10-13 12:09:33,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f33648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:33, skipping insertion in model container [2024-10-13 12:09:33,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:32" (2/3) ... [2024-10-13 12:09:33,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f33648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:09:33, skipping insertion in model container [2024-10-13 12:09:33,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:33" (3/3) ... [2024-10-13 12:09:33,658 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-13 12:09:33,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:09:33,677 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:09:33,677 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:09:33,741 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-13 12:09:33,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-10-13 12:09:33,828 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-13 12:09:33,830 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 12:09:33,834 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-13 12:09:33,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-10-13 12:09:33,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-10-13 12:09:33,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:09:33,864 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;@77f221a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:09:33,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:09:33,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:09:33,883 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-13 12:09:33,883 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:09:33,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:33,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:33,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:33,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:33,891 INFO L85 PathProgramCache]: Analyzing trace with hash 636066479, now seen corresponding path program 1 times [2024-10-13 12:09:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806932007] [2024-10-13 12:09:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:34,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806932007] [2024-10-13 12:09:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806932007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057117828] [2024-10-13 12:09:34,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:34,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:34,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:34,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:34,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:09:34,414 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-13 12:09:34,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:34,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:09:34,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:37,360 INFO L124 PetriNetUnfolderBase]: 14102/24421 cut-off events. [2024-10-13 12:09:37,360 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2024-10-13 12:09:37,459 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-13 12:09:37,625 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2024-10-13 12:09:37,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2024-10-13 12:09:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:09:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:09:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2024-10-13 12:09:37,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2024-10-13 12:09:37,644 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2024-10-13 12:09:37,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2024-10-13 12:09:37,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 12:09:37,680 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2024-10-13 12:09:37,682 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-13 12:09:37,686 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-10-13 12:09:37,688 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2024-10-13 12:09:37,689 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-13 12:09:37,689 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:37,689 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:37,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:09:37,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:37,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash 300194929, now seen corresponding path program 1 times [2024-10-13 12:09:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:37,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847262266] [2024-10-13 12:09:37,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847262266] [2024-10-13 12:09:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847262266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:09:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150298332] [2024-10-13 12:09:37,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:37,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:09:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:09:37,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:09:37,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-13 12:09:37,803 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-13 12:09:37,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:37,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-13 12:09:37,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:39,221 INFO L124 PetriNetUnfolderBase]: 6834/13886 cut-off events. [2024-10-13 12:09:39,221 INFO L125 PetriNetUnfolderBase]: For 4976/5295 co-relation queries the response was YES. [2024-10-13 12:09:39,325 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-13 12:09:39,413 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2024-10-13 12:09:39,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2024-10-13 12:09:39,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:09:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:09:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-10-13 12:09:39,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-10-13 12:09:39,416 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2024-10-13 12:09:39,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2024-10-13 12:09:39,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:09:39,709 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2024-10-13 12:09:39,709 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-13 12:09:39,710 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-10-13 12:09:39,710 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2024-10-13 12:09:39,711 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-13 12:09:39,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:39,711 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:39,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:09:39,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:39,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1645647337, now seen corresponding path program 2 times [2024-10-13 12:09:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152203948] [2024-10-13 12:09:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152203948] [2024-10-13 12:09:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152203948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:09:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853468497] [2024-10-13 12:09:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:39,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:09:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:09:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:09:39,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-13 12:09:39,817 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-13 12:09:39,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:39,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-13 12:09:39,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:41,283 INFO L124 PetriNetUnfolderBase]: 6316/12591 cut-off events. [2024-10-13 12:09:41,283 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2024-10-13 12:09:41,334 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-13 12:09:41,387 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-10-13 12:09:41,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 632 flow [2024-10-13 12:09:41,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:09:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:09:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-13 12:09:41,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-10-13 12:09:41,390 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 192 transitions. [2024-10-13 12:09:41,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 632 flow [2024-10-13 12:09:41,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:09:41,495 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2024-10-13 12:09:41,495 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-13 12:09:41,496 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-10-13 12:09:41,497 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2024-10-13 12:09:41,497 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-13 12:09:41,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:41,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:41,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 12:09:41,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:41,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash -763757256, now seen corresponding path program 1 times [2024-10-13 12:09:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:41,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127842532] [2024-10-13 12:09:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:41,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:41,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127842532] [2024-10-13 12:09:41,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127842532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:41,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:41,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:41,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701432082] [2024-10-13 12:09:41,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:41,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:41,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:41,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:09:41,650 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-13 12:09:41,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:41,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:09:41,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:44,087 INFO L124 PetriNetUnfolderBase]: 13472/22783 cut-off events. [2024-10-13 12:09:44,088 INFO L125 PetriNetUnfolderBase]: For 21011/21745 co-relation queries the response was YES. [2024-10-13 12:09:44,217 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-13 12:09:44,460 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 201 selfloop transitions, 70 changer transitions 0/301 dead transitions. [2024-10-13 12:09:44,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 1810 flow [2024-10-13 12:09:44,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:09:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:09:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2024-10-13 12:09:44,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6253101736972705 [2024-10-13 12:09:44,464 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 504 transitions. [2024-10-13 12:09:44,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 1810 flow [2024-10-13 12:09:44,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 301 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:09:44,796 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2024-10-13 12:09:44,796 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-13 12:09:44,799 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-10-13 12:09:44,799 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2024-10-13 12:09:44,799 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-13 12:09:44,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:44,799 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 12:09:44,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:44,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -911065372, now seen corresponding path program 1 times [2024-10-13 12:09:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833469341] [2024-10-13 12:09:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833469341] [2024-10-13 12:09:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833469341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:44,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:44,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658342820] [2024-10-13 12:09:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:44,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:44,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:44,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:44,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:09:44,968 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-13 12:09:44,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:44,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:09:44,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:47,652 INFO L124 PetriNetUnfolderBase]: 14310/24144 cut-off events. [2024-10-13 12:09:47,653 INFO L125 PetriNetUnfolderBase]: For 36560/36909 co-relation queries the response was YES. [2024-10-13 12:09:47,849 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-13 12:09:47,970 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 198 selfloop transitions, 87 changer transitions 0/315 dead transitions. [2024-10-13 12:09:47,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 315 transitions, 2346 flow [2024-10-13 12:09:47,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:09:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:09:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 484 transitions. [2024-10-13 12:09:47,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004962779156328 [2024-10-13 12:09:47,973 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 484 transitions. [2024-10-13 12:09:47,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 315 transitions, 2346 flow [2024-10-13 12:09:48,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 315 transitions, 2344 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-13 12:09:48,915 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2024-10-13 12:09:48,916 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-13 12:09:48,921 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-10-13 12:09:48,921 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2024-10-13 12:09:48,921 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-13 12:09:48,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:48,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:09:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 12:09:48,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:48,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1825893142, now seen corresponding path program 1 times [2024-10-13 12:09:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:48,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966687788] [2024-10-13 12:09:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:09:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:09:49,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:09:49,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966687788] [2024-10-13 12:09:49,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966687788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:09:49,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:09:49,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:09:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538488250] [2024-10-13 12:09:49,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:09:49,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:09:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:09:49,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:09:49,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:09:49,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:09:49,048 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-13 12:09:49,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:09:49,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:09:49,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:09:52,109 INFO L124 PetriNetUnfolderBase]: 15074/25341 cut-off events. [2024-10-13 12:09:52,110 INFO L125 PetriNetUnfolderBase]: For 55380/55972 co-relation queries the response was YES. [2024-10-13 12:09:52,319 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-13 12:09:52,431 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 212 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2024-10-13 12:09:52,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 2914 flow [2024-10-13 12:09:52,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:09:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:09:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2024-10-13 12:09:52,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029776674937966 [2024-10-13 12:09:52,434 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 486 transitions. [2024-10-13 12:09:52,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 2914 flow [2024-10-13 12:09:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 2900 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-10-13 12:09:53,553 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2024-10-13 12:09:53,554 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-13 12:09:53,554 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2024-10-13 12:09:53,555 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2024-10-13 12:09:53,555 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-13 12:09:53,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:09:53,555 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-13 12:09:53,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 12:09:53,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:09:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:09:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -700195909, now seen corresponding path program 1 times [2024-10-13 12:09:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:09:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706137500] [2024-10-13 12:09:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:09:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:09:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:09:53,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:09:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:09:53,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 12:09:53,654 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:09:53,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-10-13 12:09:53,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-10-13 12:09:53,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-10-13 12:09:53,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-10-13 12:09:53,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-10-13 12:09:53,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-10-13 12:09:53,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-10-13 12:09:53,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-10-13 12:09:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 12:09:53,658 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-10-13 12:09:53,716 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:09:53,716 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:09:53,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:09:53 BasicIcfg [2024-10-13 12:09:53,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:09:53,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:09:53,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:09:53,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:09:53,725 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:09:33" (3/4) ... [2024-10-13 12:09:53,726 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:09:53,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:09:53,728 INFO L158 Benchmark]: Toolchain (without parser) took 21352.08ms. Allocated memory was 201.3MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 129.2MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 723.7MB. Max. memory is 16.1GB. [2024-10-13 12:09:53,732 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:09:53,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.39ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 159.8MB in the end (delta: -30.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-10-13 12:09:53,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.06ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 157.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:53,733 INFO L158 Benchmark]: Boogie Preprocessor took 41.27ms. Allocated memory is still 201.3MB. Free memory was 157.8MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:53,734 INFO L158 Benchmark]: RCFGBuilder took 570.26ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 133.7MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:53,734 INFO L158 Benchmark]: TraceAbstraction took 20073.56ms. Allocated memory was 201.3MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 132.7MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 727.1MB. Max. memory is 16.1GB. [2024-10-13 12:09:53,734 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 7.5GB. Free memory is still 6.7GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:09:53,736 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.21ms. Allocated memory is still 201.3MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.39ms. Allocated memory is still 201.3MB. Free memory was 129.0MB in the beginning and 159.8MB in the end (delta: -30.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.06ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 157.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.27ms. Allocated memory is still 201.3MB. Free memory was 157.8MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.26ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 133.7MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20073.56ms. Allocated memory was 201.3MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 132.7MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 727.1MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 7.5GB. Free memory is still 6.7GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 1.2s 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-13 12:09:53,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:09:56,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:09:56,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:09:56,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:09:56,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:09:56,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:09:56,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:09:56,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:09:56,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:09:56,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:09:56,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:09:56,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:09:56,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:09:56,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:09:56,622 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:09:56,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:09:56,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:09:56,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:09:56,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:09:56,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:09:56,628 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:09:56,628 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:09:56,629 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:09:56,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:09:56,629 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:09:56,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:09:56,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:09:56,633 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:09:56,634 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:09:56,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:09:56,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:09:56,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:09:56,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:09:56,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:09:56,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:09:56,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:09:56,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:09:56,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:09:56,636 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:09:56,636 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:09:56,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:09:56,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:09:56,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:09:56,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:09:56,639 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:09:56,639 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-13 12:09:57,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:09:57,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:09:57,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:09:57,055 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:09:57,056 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:09:57,058 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-13 12:09:58,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:09:59,087 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:09:59,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-10-13 12:09:59,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd97a5893/197db3bd59e7460eaab6c8f6f2f529e0/FLAGa4c2ddf55 [2024-10-13 12:09:59,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd97a5893/197db3bd59e7460eaab6c8f6f2f529e0 [2024-10-13 12:09:59,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:09:59,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:09:59,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:09:59,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:09:59,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:09:59,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:59" (1/1) ... [2024-10-13 12:09:59,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88701b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:09:59, skipping insertion in model container [2024-10-13 12:09:59,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:09:59" (1/1) ... [2024-10-13 12:09:59,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:09:59,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:09:59,934 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:10:00,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:10:00,043 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:10:00,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00 WrapperNode [2024-10-13 12:10:00,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:10:00,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:10:00,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:10:00,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:10:00,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,109 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2024-10-13 12:10:00,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:10:00,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:10:00,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:10:00,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:10:00,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,154 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 12:10:00,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:10:00,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:10:00,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:10:00,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:10:00,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (1/1) ... [2024-10-13 12:10:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:10:00,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:10:00,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:10:00,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:10:00,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:10:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:10:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-10-13 12:10:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-10-13 12:10:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:10:00,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:10:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:10:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:10:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-10-13 12:10:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-10-13 12:10:00,296 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:10:00,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:10:00,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:10:00,687 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:10:00,687 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:10:00,895 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:10:00,895 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:10:00,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:00 BoogieIcfgContainer [2024-10-13 12:10:00,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:10:00,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:10:00,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:10:00,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:10:00,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:09:59" (1/3) ... [2024-10-13 12:10:00,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa28b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:00, skipping insertion in model container [2024-10-13 12:10:00,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:00" (2/3) ... [2024-10-13 12:10:00,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa28b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:10:00, skipping insertion in model container [2024-10-13 12:10:00,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:10:00" (3/3) ... [2024-10-13 12:10:00,909 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-10-13 12:10:00,928 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:10:00,929 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:10:00,929 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:10:00,999 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-13 12:10:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-10-13 12:10:01,099 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-10-13 12:10:01,099 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 12:10:01,105 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-13 12:10:01,106 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-10-13 12:10:01,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-10-13 12:10:01,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:10:01,130 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;@45d3d369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:10:01,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-13 12:10:01,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:10:01,149 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-10-13 12:10:01,150 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:10:01,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:01,151 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:01,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:01,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash 398639909, now seen corresponding path program 1 times [2024-10-13 12:10:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:01,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319146288] [2024-10-13 12:10:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:10:01,176 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-13 12:10:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:01,180 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-13 12:10:01,181 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-13 12:10:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:10:01,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:10:01,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:01,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:01,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:01,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319146288] [2024-10-13 12:10:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319146288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:01,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:10:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886965747] [2024-10-13 12:10:01,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:10:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:01,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:10:01,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:10:01,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:10:01,590 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-13 12:10:01,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:01,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:10:01,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:10:04,052 INFO L124 PetriNetUnfolderBase]: 10045/17521 cut-off events. [2024-10-13 12:10:04,052 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2024-10-13 12:10:04,109 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-13 12:10:04,220 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 150 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-10-13 12:10:04,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 202 transitions, 849 flow [2024-10-13 12:10:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:10:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:10:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-10-13 12:10:04,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6364764267990074 [2024-10-13 12:10:04,243 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-10-13 12:10:04,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 202 transitions, 849 flow [2024-10-13 12:10:04,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 799 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 12:10:04,269 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 327 flow [2024-10-13 12:10:04,271 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-13 12:10:04,276 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-10-13 12:10:04,277 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 327 flow [2024-10-13 12:10:04,277 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-13 12:10:04,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:04,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:04,283 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-13 12:10:04,478 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-13 12:10:04,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:04,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 314440543, now seen corresponding path program 1 times [2024-10-13 12:10:04,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:04,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868777110] [2024-10-13 12:10:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:10:04,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:10:04,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:04,486 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-13 12:10:04,490 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-13 12:10:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:10:04,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:10:04,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:04,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:04,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:04,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868777110] [2024-10-13 12:10:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868777110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:04,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:10:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073215799] [2024-10-13 12:10:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:04,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:10:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:04,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:10:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:10:04,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-13 12:10:04,577 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-13 12:10:04,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:04,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-13 12:10:04,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:10:05,236 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-13 12:10:05,237 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-13 12:10:05,237 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-13 12:10:05,238 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-13 12:10:05,238 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-13 12:10:05,293 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-13 12:10:05,294 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,295 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,295 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,295 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,297 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-13 12:10:05,297 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,297 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,297 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,297 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-13 12:10:05,347 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-13 12:10:05,348 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-13 12:10:05,348 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:10:05,348 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:10:05,348 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:10:05,363 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-13 12:10:05,364 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,364 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,364 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,364 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,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][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-13 12:10:05,396 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-10-13 12:10:05,396 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-13 12:10:05,396 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-13 12:10:05,396 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-10-13 12:10:05,400 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-13 12:10:05,400 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,400 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:05,435 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-13 12:10:05,435 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,435 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,436 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,436 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [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-13 12:10:05,440 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,440 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,440 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,440 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-10-13 12:10:05,444 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-13 12:10:05,444 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,444 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,445 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,445 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,445 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-13 12:10:05,445 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,445 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,445 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,446 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:05,477 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-13 12:10:05,477 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-10-13 12:10:05,477 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-13 12:10:05,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-13 12:10:05,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-10-13 12:10:05,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][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-13 12:10:05,487 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:05,487 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:05,487 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:05,487 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:05,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][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-13 12:10:05,501 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:10:05,501 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:05,502 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:05,502 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:05,593 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-13 12:10:05,594 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,594 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,594 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,594 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,604 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-13 12:10:05,605 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,605 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,605 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,605 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-10-13 12:10:05,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|)), 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-13 12:10:05,638 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,638 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,638 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,638 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,641 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-13 12:10:05,641 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,641 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,641 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,641 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-10-13 12:10:05,667 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-13 12:10:05,668 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-10-13 12:10:05,668 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-13 12:10:05,668 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-13 12:10:05,668 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-10-13 12:10:05,692 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-13 12:10:05,692 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-10-13 12:10:05,693 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-13 12:10:05,693 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-13 12:10:05,693 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-10-13 12:10:05,737 INFO L124 PetriNetUnfolderBase]: 5365/10511 cut-off events. [2024-10-13 12:10:05,738 INFO L125 PetriNetUnfolderBase]: For 3021/3052 co-relation queries the response was YES. [2024-10-13 12:10:05,790 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-13 12:10:05,856 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-10-13 12:10:05,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 460 flow [2024-10-13 12:10:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:10:05,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:10:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-10-13 12:10:05,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-10-13 12:10:05,858 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 327 flow. Second operand 3 states and 138 transitions. [2024-10-13 12:10:05,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 460 flow [2024-10-13 12:10:05,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:10:05,895 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 343 flow [2024-10-13 12:10:05,895 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-13 12:10:05,896 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-10-13 12:10:05,896 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 343 flow [2024-10-13 12:10:05,896 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-13 12:10:05,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:05,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:05,902 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-13 12:10:06,100 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-13 12:10:06,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:06,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 662849265, now seen corresponding path program 2 times [2024-10-13 12:10:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:06,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194337796] [2024-10-13 12:10:06,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:10:06,103 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-13 12:10:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:06,107 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-13 12:10:06,109 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-13 12:10:06,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:10:06,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:10:06,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:10:06,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:06,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:06,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194337796] [2024-10-13 12:10:06,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194337796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:10:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128878327] [2024-10-13 12:10:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:10:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:10:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:10:06,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-10-13 12:10:06,234 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-13 12:10:06,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:06,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-10-13 12:10:06,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:10:06,938 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-13 12:10:06,939 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-10-13 12:10:06,939 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:10:06,939 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:10:06,939 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-13 12:10:07,015 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-13 12:10:07,016 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,016 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,016 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,017 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,018 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-13 12:10:07,018 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,018 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,018 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,019 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,094 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-13 12:10:07,095 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,095 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,095 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,096 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-13 12:10:07,128 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-13 12:10:07,128 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,128 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,135 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-13 12:10:07,135 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,135 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,136 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,136 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][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-13 12:10:07,310 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,310 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,310 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,310 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][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-13 12:10:07,311 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,311 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,312 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,312 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-13 12:10:07,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][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-13 12:10:07,336 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,336 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,337 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,337 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,338 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-13 12:10:07,339 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,339 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,339 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,339 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][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-13 12:10:07,341 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,344 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-13 12:10:07,344 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,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][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-13 12:10:07,396 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,396 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,396 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,396 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,396 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-13 12:10:07,396 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,397 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,397 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,397 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-13 12:10:07,420 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-13 12:10:07,420 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,420 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,420 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,420 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][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-13 12:10:07,423 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,423 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,423 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,423 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,426 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-13 12:10:07,426 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,426 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,426 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,426 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,482 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-13 12:10:07,483 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,483 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,483 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,483 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-13 12:10:07,507 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-13 12:10:07,508 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,508 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,508 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,508 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,509 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-13 12:10:07,509 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,509 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-13 12:10:07,578 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-13 12:10:07,579 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,579 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,579 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,579 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,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][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-13 12:10:07,598 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,598 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,598 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,598 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-13 12:10:07,647 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-13 12:10:07,648 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,648 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,648 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,648 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,649 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-13 12:10:07,649 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,649 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,649 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,650 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-13 12:10:07,699 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-13 12:10:07,699 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,700 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-13 12:10:07,700 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,700 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,700 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,700 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-13 12:10:07,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 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-13 12:10:07,737 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-13 12:10:07,737 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:10:07,737 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:10:07,737 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-13 12:10:07,922 INFO L124 PetriNetUnfolderBase]: 8042/15922 cut-off events. [2024-10-13 12:10:07,922 INFO L125 PetriNetUnfolderBase]: For 8442/8498 co-relation queries the response was YES. [2024-10-13 12:10:08,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33624 conditions, 15922 events. 8042/15922 cut-off events. For 8442/8498 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 149975 event pairs, 2470 based on Foata normal form. 224/15335 useless extension candidates. Maximal degree in co-relation 27362. Up to 5206 conditions per place. [2024-10-13 12:10:08,086 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 59 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-10-13 12:10:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 606 flow [2024-10-13 12:10:08,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:10:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:10:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-13 12:10:08,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-10-13 12:10:08,088 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 343 flow. Second operand 4 states and 192 transitions. [2024-10-13 12:10:08,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 606 flow [2024-10-13 12:10:08,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:10:08,167 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 418 flow [2024-10-13 12:10:08,168 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-13 12:10:08,169 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-10-13 12:10:08,169 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 418 flow [2024-10-13 12:10:08,169 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-13 12:10:08,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:08,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:08,174 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-13 12:10:08,370 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-13 12:10:08,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1660473643, now seen corresponding path program 1 times [2024-10-13 12:10:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168445537] [2024-10-13 12:10:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:10:08,372 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-13 12:10:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:08,376 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-13 12:10:08,377 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-13 12:10:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:10:08,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:10:08,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:08,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:08,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168445537] [2024-10-13 12:10:08,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168445537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:08,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:08,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:10:08,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142040357] [2024-10-13 12:10:08,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:08,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:10:08,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:10:08,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:10:08,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:10:08,588 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-13 12:10:08,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:08,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:10:08,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:10:12,261 INFO L124 PetriNetUnfolderBase]: 22936/39577 cut-off events. [2024-10-13 12:10:12,261 INFO L125 PetriNetUnfolderBase]: For 27767/27887 co-relation queries the response was YES. [2024-10-13 12:10:12,481 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-13 12:10:12,929 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 226 selfloop transitions, 32 changer transitions 0/279 dead transitions. [2024-10-13 12:10:12,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 279 transitions, 1634 flow [2024-10-13 12:10:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:10:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:10:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 451 transitions. [2024-10-13 12:10:12,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-10-13 12:10:12,932 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 418 flow. Second operand 11 states and 451 transitions. [2024-10-13 12:10:12,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 279 transitions, 1634 flow [2024-10-13 12:10:13,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 279 transitions, 1616 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-13 12:10:13,179 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 566 flow [2024-10-13 12:10:13,180 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-13 12:10:13,181 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2024-10-13 12:10:13,181 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 566 flow [2024-10-13 12:10:13,181 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-13 12:10:13,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:13,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:13,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 (5)] Ended with exit code 0 [2024-10-13 12:10:13,382 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-13 12:10:13,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:13,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1308458934, now seen corresponding path program 1 times [2024-10-13 12:10:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:13,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402544671] [2024-10-13 12:10:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:10:13,384 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-13 12:10:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:13,404 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-13 12:10:13,406 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-13 12:10:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:10:13,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:10:13,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:13,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:13,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402544671] [2024-10-13 12:10:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402544671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:13,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:13,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:10:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012862063] [2024-10-13 12:10:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:13,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:10:13,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:10:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:10:13,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:10:13,623 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-13 12:10:13,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:13,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:10:13,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:10:18,662 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-13 12:10:18,663 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-13 12:10:18,663 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:10:18,663 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:10:18,663 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:10:18,689 INFO L124 PetriNetUnfolderBase]: 34967/58050 cut-off events. [2024-10-13 12:10:18,690 INFO L125 PetriNetUnfolderBase]: For 66113/67929 co-relation queries the response was YES. [2024-10-13 12:10:19,356 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-13 12:10:19,622 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 156 selfloop transitions, 107 changer transitions 0/299 dead transitions. [2024-10-13 12:10:19,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 299 transitions, 2074 flow [2024-10-13 12:10:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 12:10:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-13 12:10:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 466 transitions. [2024-10-13 12:10:19,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5781637717121588 [2024-10-13 12:10:19,625 INFO L175 Difference]: Start difference. First operand has 97 places, 111 transitions, 566 flow. Second operand 13 states and 466 transitions. [2024-10-13 12:10:19,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 299 transitions, 2074 flow [2024-10-13 12:10:20,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 299 transitions, 1972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-13 12:10:20,482 INFO L231 Difference]: Finished difference. Result has 116 places, 194 transitions, 1368 flow [2024-10-13 12:10:20,483 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-13 12:10:20,483 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 50 predicate places. [2024-10-13 12:10:20,484 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 194 transitions, 1368 flow [2024-10-13 12:10:20,484 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-13 12:10:20,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:20,484 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:20,489 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-13 12:10:20,684 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-13 12:10:20,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:20,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1734772438, now seen corresponding path program 1 times [2024-10-13 12:10:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:20,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148855960] [2024-10-13 12:10:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:10:20,687 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-13 12:10:20,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:20,688 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-13 12:10:20,689 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-13 12:10:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:10:20,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:10:20,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:20,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:20,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148855960] [2024-10-13 12:10:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148855960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:20,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:20,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 12:10:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643739309] [2024-10-13 12:10:20,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:20,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:10:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:10:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:10:20,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:10:20,886 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-13 12:10:20,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:20,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:10:20,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:10:30,820 INFO L124 PetriNetUnfolderBase]: 54474/91564 cut-off events. [2024-10-13 12:10:30,820 INFO L125 PetriNetUnfolderBase]: For 119080/121088 co-relation queries the response was YES. [2024-10-13 12:10:31,738 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-13 12:10:32,145 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 240 selfloop transitions, 110 changer transitions 0/386 dead transitions. [2024-10-13 12:10:32,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 386 transitions, 2968 flow [2024-10-13 12:10:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:10:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:10:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2024-10-13 12:10:32,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6495601173020528 [2024-10-13 12:10:32,148 INFO L175 Difference]: Start difference. First operand has 116 places, 194 transitions, 1368 flow. Second operand 11 states and 443 transitions. [2024-10-13 12:10:32,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 386 transitions, 2968 flow [2024-10-13 12:10:35,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 386 transitions, 2962 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-13 12:10:35,392 INFO L231 Difference]: Finished difference. Result has 132 places, 217 transitions, 1806 flow [2024-10-13 12:10:35,392 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-13 12:10:35,393 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-10-13 12:10:35,393 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 1806 flow [2024-10-13 12:10:35,393 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-13 12:10:35,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:10:35,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:10:35,398 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-13 12:10:35,594 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-13 12:10:35,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-13 12:10:35,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:10:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -336258438, now seen corresponding path program 1 times [2024-10-13 12:10:35,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:10:35,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672124514] [2024-10-13 12:10:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:10:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:10:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:10:35,597 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-13 12:10:35,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:10:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:10:35,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:10:35,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:10:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:10:35,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:10:35,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:10:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672124514] [2024-10-13 12:10:35,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672124514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:10:35,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:10:35,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 12:10:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348780474] [2024-10-13 12:10:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:10:35,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 12:10:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:10:35,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 12:10:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 12:10:35,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-10-13 12:10:35,772 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-13 12:10:35,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:10:35,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-10-13 12:10:35,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand