./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\nCHECK( init(main()), LTL(G valid-deref) )\nCHECK( init(main()), LTL(G valid-memtrack) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-07 19:07:18,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:07:18,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-07 19:07:18,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:07:18,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:07:18,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:07:18,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:07:18,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:07:18,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:07:18,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:07:18,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:07:18,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:07:18,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:07:18,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:07:18,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:07:18,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:07:18,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:07:18,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:07:18,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:07:18,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:07:18,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:07:18,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:07:18,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:07:18,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:07:18,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:07:18,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:07:18,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:07:18,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:07:18,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:07:18,301 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-11-07 19:07:18,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:07:18,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:07:18,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:07:18,592 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:07:18,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:07:18,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-07 19:07:19,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:07:20,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:07:20,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-07 19:07:20,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e9820da8/69bb7a8ae1c24d7ab10f29863074e966/FLAG243879c8e [2024-11-07 19:07:20,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e9820da8/69bb7a8ae1c24d7ab10f29863074e966 [2024-11-07 19:07:20,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:07:20,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:07:20,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:07:20,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:07:20,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:07:20,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5000fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20, skipping insertion in model container [2024-11-07 19:07:20,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:07:20,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:07:20,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:07:20,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:07:20,672 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:07:20,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20 WrapperNode [2024-11-07 19:07:20,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:07:20,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:07:20,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:07:20,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:07:20,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,713 INFO L138 Inliner]: procedures = 172, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 96 [2024-11-07 19:07:20,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:07:20,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:07:20,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:07:20,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:07:20,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,741 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:07:20,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:07:20,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:07:20,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:07:20,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:07:20,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (1/1) ... [2024-11-07 19:07:20,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:07:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:07:20,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:07:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-11-07 19:07:20,807 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:07:20,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:07:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-11-07 19:07:20,807 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-11-07 19:07:20,808 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:07:20,905 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:07:20,906 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:07:21,053 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:07:21,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:07:21,206 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:07:21,207 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:07:21,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:21 BoogieIcfgContainer [2024-11-07 19:07:21,207 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:07:21,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:07:21,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:07:21,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:07:21,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:07:20" (1/3) ... [2024-11-07 19:07:21,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ece3e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:21, skipping insertion in model container [2024-11-07 19:07:21,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:20" (2/3) ... [2024-11-07 19:07:21,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ece3e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:21, skipping insertion in model container [2024-11-07 19:07:21,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:21" (3/3) ... [2024-11-07 19:07:21,219 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-11-07 19:07:21,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:07:21,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 19:07:21,234 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:07:21,297 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-07 19:07:21,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-11-07 19:07:21,367 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-07 19:07:21,370 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 19:07:21,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-07 19:07:21,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-11-07 19:07:21,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-11-07 19:07:21,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:07:21,392 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;@5560ce99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:07:21,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:07:21,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:07:21,409 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-11-07 19:07:21,409 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:07:21,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:21,410 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:21,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:21,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 636066479, now seen corresponding path program 1 times [2024-11-07 19:07:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391710773] [2024-11-07 19:07:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391710773] [2024-11-07 19:07:21,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391710773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:21,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:21,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:07:21,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554199155] [2024-11-07 19:07:21,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:21,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:07:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:07:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:07:21,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:21,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:21,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:21,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:21,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:24,382 INFO L124 PetriNetUnfolderBase]: 14102/24421 cut-off events. [2024-11-07 19:07:24,382 INFO L125 PetriNetUnfolderBase]: For 2090/2090 co-relation queries the response was YES. [2024-11-07 19:07:24,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45384 conditions, 24421 events. 14102/24421 cut-off events. For 2090/2090 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 210247 event pairs, 1527 based on Foata normal form. 2538/26333 useless extension candidates. Maximal degree in co-relation 40085. Up to 6266 conditions per place. [2024-11-07 19:07:24,586 INFO L140 encePairwiseOnDemand]: 47/62 looper letters, 179 selfloop transitions, 37 changer transitions 0/233 dead transitions. [2024-11-07 19:07:24,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 233 transitions, 1015 flow [2024-11-07 19:07:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:07:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:07:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 544 transitions. [2024-11-07 19:07:24,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.674937965260546 [2024-11-07 19:07:24,606 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 544 transitions. [2024-11-07 19:07:24,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 233 transitions, 1015 flow [2024-11-07 19:07:24,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 233 transitions, 937 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-07 19:07:24,666 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 353 flow [2024-11-07 19:07:24,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=353, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2024-11-07 19:07:24,672 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-11-07 19:07:24,673 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 353 flow [2024-11-07 19:07:24,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:24,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:24,673 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:07:24,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash 300194929, now seen corresponding path program 1 times [2024-11-07 19:07:24,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:24,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818805185] [2024-11-07 19:07:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818805185] [2024-11-07 19:07:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818805185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:24,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:24,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730675550] [2024-11-07 19:07:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:24,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:07:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:07:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:07:24,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-07 19:07:24,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:24,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:24,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-07 19:07:24,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:26,012 INFO L124 PetriNetUnfolderBase]: 6834/13886 cut-off events. [2024-11-07 19:07:26,012 INFO L125 PetriNetUnfolderBase]: For 4976/5295 co-relation queries the response was YES. [2024-11-07 19:07:26,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28294 conditions, 13886 events. 6834/13886 cut-off events. For 4976/5295 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 134465 event pairs, 2739 based on Foata normal form. 717/13669 useless extension candidates. Maximal degree in co-relation 22139. Up to 5307 conditions per place. [2024-11-07 19:07:26,161 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2024-11-07 19:07:26,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 486 flow [2024-11-07 19:07:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:07:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:07:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-07 19:07:26,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-11-07 19:07:26,166 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 353 flow. Second operand 3 states and 138 transitions. [2024-11-07 19:07:26,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 486 flow [2024-11-07 19:07:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:07:26,277 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 369 flow [2024-11-07 19:07:26,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2024-11-07 19:07:26,278 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-11-07 19:07:26,278 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 369 flow [2024-11-07 19:07:26,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:26,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:26,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:07:26,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1645647337, now seen corresponding path program 2 times [2024-11-07 19:07:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619630912] [2024-11-07 19:07:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:26,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:26,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:26,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619630912] [2024-11-07 19:07:26,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619630912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:26,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759098813] [2024-11-07 19:07:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:26,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:07:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:07:26,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:07:26,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-07 19:07:26,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:26,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:26,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-07 19:07:26,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:27,450 INFO L124 PetriNetUnfolderBase]: 6316/12591 cut-off events. [2024-11-07 19:07:27,451 INFO L125 PetriNetUnfolderBase]: For 6176/6368 co-relation queries the response was YES. [2024-11-07 19:07:27,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27257 conditions, 12591 events. 6316/12591 cut-off events. For 6176/6368 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 113465 event pairs, 1680 based on Foata normal form. 318/12552 useless extension candidates. Maximal degree in co-relation 24216. Up to 3792 conditions per place. [2024-11-07 19:07:27,526 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 61 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2024-11-07 19:07:27,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 632 flow [2024-11-07 19:07:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:07:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:07:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-07 19:07:27,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-11-07 19:07:27,527 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 369 flow. Second operand 4 states and 192 transitions. [2024-11-07 19:07:27,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 632 flow [2024-11-07 19:07:27,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 133 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:07:27,612 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 435 flow [2024-11-07 19:07:27,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2024-11-07 19:07:27,613 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 17 predicate places. [2024-11-07 19:07:27,614 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 435 flow [2024-11-07 19:07:27,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:27,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:27,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:27,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:07:27,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -763757256, now seen corresponding path program 1 times [2024-11-07 19:07:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396572693] [2024-11-07 19:07:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396572693] [2024-11-07 19:07:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396572693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:07:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693959589] [2024-11-07 19:07:27,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:07:27,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:27,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:07:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:07:27,747 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:27,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:27,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:27,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:27,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:29,400 INFO L124 PetriNetUnfolderBase]: 13472/22783 cut-off events. [2024-11-07 19:07:29,401 INFO L125 PetriNetUnfolderBase]: For 21011/21745 co-relation queries the response was YES. [2024-11-07 19:07:29,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56662 conditions, 22783 events. 13472/22783 cut-off events. For 21011/21745 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 182277 event pairs, 2029 based on Foata normal form. 460/22855 useless extension candidates. Maximal degree in co-relation 52344. Up to 5101 conditions per place. [2024-11-07 19:07:29,549 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 201 selfloop transitions, 70 changer transitions 0/301 dead transitions. [2024-11-07 19:07:29,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 1810 flow [2024-11-07 19:07:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:07:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:07:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 504 transitions. [2024-11-07 19:07:29,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6253101736972705 [2024-11-07 19:07:29,552 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 435 flow. Second operand 13 states and 504 transitions. [2024-11-07 19:07:29,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 1810 flow [2024-11-07 19:07:29,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 301 transitions, 1810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:07:30,007 INFO L231 Difference]: Finished difference. Result has 105 places, 157 transitions, 1038 flow [2024-11-07 19:07:30,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1038, PETRI_PLACES=105, PETRI_TRANSITIONS=157} [2024-11-07 19:07:30,009 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-11-07 19:07:30,009 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 157 transitions, 1038 flow [2024-11-07 19:07:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:30,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:30,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:30,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:07:30,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:30,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash -911065372, now seen corresponding path program 1 times [2024-11-07 19:07:30,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495138430] [2024-11-07 19:07:30,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495138430] [2024-11-07 19:07:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495138430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:30,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:07:30,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961908118] [2024-11-07 19:07:30,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:30,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:07:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:30,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:07:30,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:07:30,144 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:30,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 157 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:30,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:30,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:30,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:31,814 INFO L124 PetriNetUnfolderBase]: 14310/24144 cut-off events. [2024-11-07 19:07:31,814 INFO L125 PetriNetUnfolderBase]: For 36560/36909 co-relation queries the response was YES. [2024-11-07 19:07:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70727 conditions, 24144 events. 14310/24144 cut-off events. For 36560/36909 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 194157 event pairs, 3049 based on Foata normal form. 444/24353 useless extension candidates. Maximal degree in co-relation 66403. Up to 7170 conditions per place. [2024-11-07 19:07:31,947 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 198 selfloop transitions, 87 changer transitions 0/315 dead transitions. [2024-11-07 19:07:31,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 315 transitions, 2346 flow [2024-11-07 19:07:31,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:07:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:07:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 484 transitions. [2024-11-07 19:07:31,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004962779156328 [2024-11-07 19:07:31,951 INFO L175 Difference]: Start difference. First operand has 105 places, 157 transitions, 1038 flow. Second operand 13 states and 484 transitions. [2024-11-07 19:07:31,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 315 transitions, 2346 flow [2024-11-07 19:07:32,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 315 transitions, 2344 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-11-07 19:07:32,483 INFO L231 Difference]: Finished difference. Result has 121 places, 186 transitions, 1516 flow [2024-11-07 19:07:32,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1516, PETRI_PLACES=121, PETRI_TRANSITIONS=186} [2024-11-07 19:07:32,484 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 55 predicate places. [2024-11-07 19:07:32,484 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 186 transitions, 1516 flow [2024-11-07 19:07:32,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:32,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:32,485 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:32,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:07:32,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:32,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1825893142, now seen corresponding path program 1 times [2024-11-07 19:07:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898532241] [2024-11-07 19:07:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:07:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898532241] [2024-11-07 19:07:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898532241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:07:32,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397916245] [2024-11-07 19:07:32,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:32,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:07:32,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:07:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:07:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:07:32,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:32,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 186 transitions, 1516 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:32,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:32,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:32,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:35,102 INFO L124 PetriNetUnfolderBase]: 15074/25341 cut-off events. [2024-11-07 19:07:35,102 INFO L125 PetriNetUnfolderBase]: For 55380/55972 co-relation queries the response was YES. [2024-11-07 19:07:35,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78221 conditions, 25341 events. 15074/25341 cut-off events. For 55380/55972 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 202802 event pairs, 2998 based on Foata normal form. 648/25708 useless extension candidates. Maximal degree in co-relation 74131. Up to 7239 conditions per place. [2024-11-07 19:07:35,212 INFO L140 encePairwiseOnDemand]: 51/62 looper letters, 212 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2024-11-07 19:07:35,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 350 transitions, 2914 flow [2024-11-07 19:07:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:07:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:07:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2024-11-07 19:07:35,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6029776674937966 [2024-11-07 19:07:35,215 INFO L175 Difference]: Start difference. First operand has 121 places, 186 transitions, 1516 flow. Second operand 13 states and 486 transitions. [2024-11-07 19:07:35,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 350 transitions, 2914 flow [2024-11-07 19:07:35,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 2900 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:35,939 INFO L231 Difference]: Finished difference. Result has 136 places, 215 transitions, 2010 flow [2024-11-07 19:07:35,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2010, PETRI_PLACES=136, PETRI_TRANSITIONS=215} [2024-11-07 19:07:35,939 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 70 predicate places. [2024-11-07 19:07:35,940 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 215 transitions, 2010 flow [2024-11-07 19:07:35,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:35,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:35,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:35,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:07:35,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:35,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash -700195909, now seen corresponding path program 1 times [2024-11-07 19:07:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:07:35,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675392324] [2024-11-07 19:07:35,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:35,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:07:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:07:35,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:07:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:07:35,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:07:35,998 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:07:35,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-07 19:07:36,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-07 19:07:36,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-07 19:07:36,001 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-07 19:07:36,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-07 19:07:36,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-07 19:07:36,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-07 19:07:36,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-07 19:07:36,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:07:36,004 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-07 19:07:36,055 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 19:07:36,055 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:07:36,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:07:36 BasicIcfg [2024-11-07 19:07:36,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:07:36,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:07:36,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:07:36,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:07:36,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:21" (3/4) ... [2024-11-07 19:07:36,063 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:07:36,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:07:36,066 INFO L158 Benchmark]: Toolchain (without parser) took 15867.13ms. Allocated memory was 100.7MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 75.9MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-07 19:07:36,066 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:07:36,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.14ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 56.3MB in the end (delta: 19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:07:36,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.17ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 54.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:07:36,068 INFO L158 Benchmark]: Boogie Preprocessor took 37.18ms. Allocated memory is still 100.7MB. Free memory was 54.5MB in the beginning and 53.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:07:36,068 INFO L158 Benchmark]: RCFGBuilder took 455.72ms. Allocated memory is still 100.7MB. Free memory was 52.9MB in the beginning and 70.9MB in the end (delta: -18.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-11-07 19:07:36,069 INFO L158 Benchmark]: TraceAbstraction took 14850.36ms. Allocated memory was 100.7MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 70.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 991.1MB. Max. memory is 16.1GB. [2024-11-07 19:07:36,069 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 95.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:07:36,070 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.45ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.14ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 56.3MB in the end (delta: 19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.17ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 54.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.18ms. Allocated memory is still 100.7MB. Free memory was 54.5MB in the beginning and 53.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 455.72ms. Allocated memory is still 100.7MB. Free memory was 52.9MB in the beginning and 70.9MB in the end (delta: -18.0MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14850.36ms. Allocated memory was 100.7MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 70.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 991.1MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 95.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-3, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-3, t2=-2, w=0, x=0, y=0] [L724] 2 int l; VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-3, t2=-2, t3=-1, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, t1=-3, t2=-2, t3=-1, t4=0, w=0, x=0, y=0] [L724] 4 int l; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [\old(arg)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\old(arg)={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) VAL [r=0, w=1, x=3, y=0] [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 84 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.8s 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.5s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:07:36,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-4f9af40 [2024-11-07 19:07:38,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:07:38,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-07 19:07:38,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:07:38,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:07:38,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:07:38,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:07:38,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:07:38,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:07:38,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:07:38,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:07:38,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:07:38,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:07:38,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:07:38,562 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:07:38,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:07:38,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:07:38,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:07:38,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:07:38,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:07:38,563 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 19:07:38,563 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 19:07:38,563 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:07:38,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:07:38,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:07:38,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:07:38,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:07:38,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:07:38,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:07:38,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:07:38,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:07:38,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:07:38,566 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:07:38,566 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:07:38,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:07:38,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:07:38,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:07:38,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:07:38,567 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2024-11-07 19:07:38,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:07:38,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:07:38,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:07:38,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:07:38,836 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:07:38,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-07 19:07:40,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:07:40,428 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:07:40,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2024-11-07 19:07:40,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2036b8cf1/cfdb3400a6494eb182a767ddf15849f7/FLAG823a654e0 [2024-11-07 19:07:40,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2036b8cf1/cfdb3400a6494eb182a767ddf15849f7 [2024-11-07 19:07:40,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:07:40,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:07:40,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:07:40,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:07:40,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:07:40,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:40" (1/1) ... [2024-11-07 19:07:40,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b82613f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:40, skipping insertion in model container [2024-11-07 19:07:40,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:07:40" (1/1) ... [2024-11-07 19:07:40,791 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:07:41,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:07:41,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:07:41,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:07:41,163 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:07:41,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41 WrapperNode [2024-11-07 19:07:41,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:07:41,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:07:41,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:07:41,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:07:41,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,204 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 97 [2024-11-07 19:07:41,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:07:41,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:07:41,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:07:41,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:07:41,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,233 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:07:41,235 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:07:41,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:07:41,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:07:41,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:07:41,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (1/1) ... [2024-11-07 19:07:41,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:07:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:07:41,287 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:07:41,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:07:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-07 19:07:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:07:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-11-07 19:07:41,311 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-11-07 19:07:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:07:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-07 19:07:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:07:41,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:07:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-11-07 19:07:41,311 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-11-07 19:07:41,312 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 19:07:41,418 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:07:41,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:07:41,599 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 19:07:41,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:07:41,770 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:07:41,770 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 19:07:41,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:41 BoogieIcfgContainer [2024-11-07 19:07:41,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:07:41,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:07:41,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:07:41,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:07:41,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:07:40" (1/3) ... [2024-11-07 19:07:41,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e39e143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:41, skipping insertion in model container [2024-11-07 19:07:41,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:07:41" (2/3) ... [2024-11-07 19:07:41,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e39e143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:07:41, skipping insertion in model container [2024-11-07 19:07:41,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:07:41" (3/3) ... [2024-11-07 19:07:41,782 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2024-11-07 19:07:41,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:07:41,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 19:07:41,796 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 19:07:41,858 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-07 19:07:41,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2024-11-07 19:07:41,925 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2024-11-07 19:07:41,927 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 19:07:41,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-07 19:07:41,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2024-11-07 19:07:41,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 138 flow [2024-11-07 19:07:41,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:07:41,953 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;@5a773488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:07:41,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:07:41,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 19:07:41,968 INFO L124 PetriNetUnfolderBase]: 2/38 cut-off events. [2024-11-07 19:07:41,968 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 19:07:41,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:41,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:41,969 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 398639909, now seen corresponding path program 1 times [2024-11-07 19:07:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424048279] [2024-11-07 19:07:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:41,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:41,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:41,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:07:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:42,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:07:42,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:42,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:42,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424048279] [2024-11-07 19:07:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424048279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:42,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:42,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:07:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612472862] [2024-11-07 19:07:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:42,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:07:42,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:42,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:07:42,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:07:42,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:42,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 138 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:42,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:42,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:42,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:44,661 INFO L124 PetriNetUnfolderBase]: 10045/17521 cut-off events. [2024-11-07 19:07:44,662 INFO L125 PetriNetUnfolderBase]: For 1316/1316 co-relation queries the response was YES. [2024-11-07 19:07:44,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32443 conditions, 17521 events. 10045/17521 cut-off events. For 1316/1316 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 143213 event pairs, 2999 based on Foata normal form. 1552/18547 useless extension candidates. Maximal degree in co-relation 29201. Up to 8171 conditions per place. [2024-11-07 19:07:44,788 INFO L140 encePairwiseOnDemand]: 48/62 looper letters, 150 selfloop transitions, 35 changer transitions 0/202 dead transitions. [2024-11-07 19:07:44,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 202 transitions, 849 flow [2024-11-07 19:07:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:07:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:07:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-11-07 19:07:44,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6364764267990074 [2024-11-07 19:07:44,808 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-11-07 19:07:44,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 202 transitions, 849 flow [2024-11-07 19:07:44,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 799 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-07 19:07:44,836 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 327 flow [2024-11-07 19:07:44,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=75, PETRI_TRANSITIONS=89} [2024-11-07 19:07:44,844 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2024-11-07 19:07:44,844 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 327 flow [2024-11-07 19:07:44,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:44,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:44,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:44,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:07:45,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:45,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:45,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 314440543, now seen corresponding path program 1 times [2024-11-07 19:07:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989570032] [2024-11-07 19:07:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:45,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:45,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:45,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:45,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:07:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:45,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:07:45,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:45,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:45,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989570032] [2024-11-07 19:07:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989570032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909460757] [2024-11-07 19:07:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:07:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:07:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:07:45,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-07 19:07:45,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:45,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:45,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-07 19:07:45,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:45,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 51#L720true, 74#true, 138#true, 11#L16true]) [2024-11-07 19:07:45,752 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-07 19:07:45,753 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-07 19:07:45,753 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-07 19:07:45,753 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-07 19:07:45,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, 11#L16true]) [2024-11-07 19:07:45,845 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,845 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,845 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,846 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 51#L720true, 74#true, 138#true, 11#L16true]) [2024-11-07 19:07:45,851 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-07 19:07:45,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue, 11#L16true]) [2024-11-07 19:07:45,989 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-07 19:07:45,989 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-07 19:07:45,989 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-07 19:07:45,989 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-07 19:07:46,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 74#true, 138#true, 11#L16true]) [2024-11-07 19:07:46,028 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,031 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 51#L720true, 74#true, 11#L16true]) [2024-11-07 19:07:46,078 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2024-11-07 19:07:46,078 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-07 19:07:46,078 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-07 19:07:46,078 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2024-11-07 19:07:46,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 51#L720true, 74#true, 138#true]) [2024-11-07 19:07:46,081 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,082 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:46,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue, 11#L16true]) [2024-11-07 19:07:46,119 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,119 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,119 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,119 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 11#L16true]) [2024-11-07 19:07:46,124 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,124 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,124 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,124 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2024-11-07 19:07:46,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][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue]) [2024-11-07 19:07:46,128 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,128 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,128 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,128 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 51#L720true, 74#true, 138#true]) [2024-11-07 19:07:46,129 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,129 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:46,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue, 11#L16true]) [2024-11-07 19:07:46,162 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2024-11-07 19:07:46,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-11-07 19:07:46,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-11-07 19:07:46,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2024-11-07 19:07:46,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue]) [2024-11-07 19:07:46,171 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:46,171 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:46,171 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:46,172 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:46,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][68], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 38#$Ultimate##0true, 74#true, 138#true]) [2024-11-07 19:07:46,186 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-07 19:07:46,186 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:46,186 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:46,186 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:46,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true, 11#L16true]) [2024-11-07 19:07:46,205 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,205 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 51#L720true, 74#true]) [2024-11-07 19:07:46,215 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,215 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,215 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,215 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2024-11-07 19:07:46,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue]) [2024-11-07 19:07:46,245 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,245 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,245 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,245 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true]) [2024-11-07 19:07:46,247 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,247 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,247 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,247 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2024-11-07 19:07:46,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue]) [2024-11-07 19:07:46,274 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2024-11-07 19:07:46,274 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-11-07 19:07:46,274 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-11-07 19:07:46,274 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2024-11-07 19:07:46,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][59], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true]) [2024-11-07 19:07:46,295 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2024-11-07 19:07:46,295 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-11-07 19:07:46,295 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-11-07 19:07:46,295 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2024-11-07 19:07:46,336 INFO L124 PetriNetUnfolderBase]: 5365/10511 cut-off events. [2024-11-07 19:07:46,337 INFO L125 PetriNetUnfolderBase]: For 3021/3052 co-relation queries the response was YES. [2024-11-07 19:07:46,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20947 conditions, 10511 events. 5365/10511 cut-off events. For 3021/3052 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 92897 event pairs, 2513 based on Foata normal form. 516/10292 useless extension candidates. Maximal degree in co-relation 16954. Up to 4180 conditions per place. [2024-11-07 19:07:46,443 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 40 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2024-11-07 19:07:46,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 460 flow [2024-11-07 19:07:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:07:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 19:07:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-07 19:07:46,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2024-11-07 19:07:46,445 INFO L175 Difference]: Start difference. First operand has 75 places, 89 transitions, 327 flow. Second operand 3 states and 138 transitions. [2024-11-07 19:07:46,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 460 flow [2024-11-07 19:07:46,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 106 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 19:07:46,476 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 343 flow [2024-11-07 19:07:46,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2024-11-07 19:07:46,477 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-11-07 19:07:46,477 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 343 flow [2024-11-07 19:07:46,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:46,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:46,478 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:46,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 19:07:46,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:46,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:46,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash 662849265, now seen corresponding path program 2 times [2024-11-07 19:07:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:46,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994813869] [2024-11-07 19:07:46,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:07:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:46,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:46,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:07:46,742 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 19:07:46,742 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:07:46,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:07:46,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:46,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:46,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994813869] [2024-11-07 19:07:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994813869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:46,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:07:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471304287] [2024-11-07 19:07:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:07:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:07:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:07:46,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-07 19:07:46,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:46,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:46,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-07 19:07:46,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:47,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true, 11#L16true]) [2024-11-07 19:07:47,363 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-07 19:07:47,363 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-07 19:07:47,363 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-07 19:07:47,363 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-07 19:07:47,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|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue, 11#L16true]) [2024-11-07 19:07:47,427 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,427 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 11#L16true]) [2024-11-07 19:07:47,428 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,428 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,429 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,429 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,627 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,627 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,627 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,627 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-07 19:07:47,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue, 11#L16true]) [2024-11-07 19:07:47,645 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,645 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,646 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,646 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,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][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true, 7#L744true]) [2024-11-07 19:07:47,649 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 38#$Ultimate##0true, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,688 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,688 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,688 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,688 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,689 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,689 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,689 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,689 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-07 19:07:47,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 152#(= ~w~0 (_ bv1 32)), 74#true, 11#L16true]) [2024-11-07 19:07:47,707 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,707 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,707 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,707 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 7#L744true, 21#writerEXITtrue]) [2024-11-07 19:07:47,709 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,709 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,709 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,709 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true, 7#L744true]) [2024-11-07 19:07:47,711 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,711 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,711 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,711 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 51#L720true, 17#L752-4true, 74#true]) [2024-11-07 19:07:47,714 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,714 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,714 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,714 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 74#true, 138#true, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,753 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,753 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,753 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,753 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 38#$Ultimate##0true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,753 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,754 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,754 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,754 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-07 19:07:47,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 7#L744true, 21#writerEXITtrue]) [2024-11-07 19:07:47,770 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,770 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,770 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,770 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 17#L752-4true, 74#true, 21#writerEXITtrue]) [2024-11-07 19:07:47,772 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,772 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,772 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,772 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [42#L16true, 8#L714-1true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 51#L720true, 74#true]) [2024-11-07 19:07:47,774 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,774 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,774 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,774 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 38#$Ultimate##0true, 74#true, 138#true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,817 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,817 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,817 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,817 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-07 19:07:47,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 74#true, 7#L744true]) [2024-11-07 19:07:47,834 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,834 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,835 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,835 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 62#L753true, 152#(= ~w~0 (_ bv1 32)), 74#true, 21#writerEXITtrue]) [2024-11-07 19:07:47,835 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,836 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,836 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,836 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-07 19:07:47,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][107], [8#L714-1true, 42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 192#(= ~r~0 (_ bv0 32)), 152#(= ~w~0 (_ bv1 32)), 74#true]) [2024-11-07 19:07:47,895 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,895 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,895 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,895 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 17#L752-4true, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:47,914 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,914 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,914 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-07 19:07:47,914 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-07 19:07:48,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 10#writerEXITtrue, 74#true, 138#true, 7#L744true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:48,040 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,040 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,040 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,040 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 17#L752-4true, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:48,042 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,042 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,042 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,042 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-07 19:07:48,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 74#true, 138#true, 7#L744true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:48,080 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 62#L753true, 187#true, 10#writerEXITtrue, 74#true, 138#true, 21#writerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:48,081 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,081 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-07 19:07:48,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L737-->L16: Formula: (not (= |v_readerThread1of1ForFork2_~ly~0#1_5| |v_readerThread1of1ForFork2_~lx~0#1_5|)) InVars {readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|} OutVars{readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_1|, readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_5|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][108], [42#L16true, Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 41#readerEXITtrue, Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 187#true, 10#writerEXITtrue, 74#true, 138#true, Black: 152#(= ~w~0 (_ bv1 32))]) [2024-11-07 19:07:48,112 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-07 19:07:48,112 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:07:48,112 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:07:48,112 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-07 19:07:48,159 INFO L124 PetriNetUnfolderBase]: 8042/15922 cut-off events. [2024-11-07 19:07:48,159 INFO L125 PetriNetUnfolderBase]: For 8442/8498 co-relation queries the response was YES. [2024-11-07 19:07:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33624 conditions, 15922 events. 8042/15922 cut-off events. For 8442/8498 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 149975 event pairs, 2470 based on Foata normal form. 224/15335 useless extension candidates. Maximal degree in co-relation 27362. Up to 5206 conditions per place. [2024-11-07 19:07:48,272 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 59 selfloop transitions, 11 changer transitions 0/132 dead transitions. [2024-11-07 19:07:48,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 132 transitions, 606 flow [2024-11-07 19:07:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:07:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 19:07:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-07 19:07:48,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7741935483870968 [2024-11-07 19:07:48,274 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 343 flow. Second operand 4 states and 192 transitions. [2024-11-07 19:07:48,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 132 transitions, 606 flow [2024-11-07 19:07:48,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 19:07:48,335 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 418 flow [2024-11-07 19:07:48,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2024-11-07 19:07:48,336 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-11-07 19:07:48,336 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 418 flow [2024-11-07 19:07:48,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:48,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:48,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:48,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:07:48,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:48,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:48,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1660473643, now seen corresponding path program 1 times [2024-11-07 19:07:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578618160] [2024-11-07 19:07:48,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:48,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:48,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:48,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:48,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:07:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:48,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:07:48,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:48,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:48,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578618160] [2024-11-07 19:07:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578618160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:48,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:07:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758286246] [2024-11-07 19:07:48,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:48,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:07:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:07:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:07:48,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:48,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:48,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:48,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:48,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:51,541 INFO L124 PetriNetUnfolderBase]: 22936/39577 cut-off events. [2024-11-07 19:07:51,542 INFO L125 PetriNetUnfolderBase]: For 27767/27887 co-relation queries the response was YES. [2024-11-07 19:07:51,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93161 conditions, 39577 events. 22936/39577 cut-off events. For 27767/27887 co-relation queries the response was YES. Maximal size of possible extension queue 2259. Compared 363815 event pairs, 5973 based on Foata normal form. 559/39079 useless extension candidates. Maximal degree in co-relation 84174. Up to 13825 conditions per place. [2024-11-07 19:07:51,837 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 226 selfloop transitions, 32 changer transitions 0/279 dead transitions. [2024-11-07 19:07:51,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 279 transitions, 1634 flow [2024-11-07 19:07:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:07:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:07:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 451 transitions. [2024-11-07 19:07:51,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2024-11-07 19:07:51,839 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 418 flow. Second operand 11 states and 451 transitions. [2024-11-07 19:07:51,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 279 transitions, 1634 flow [2024-11-07 19:07:52,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 279 transitions, 1616 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-07 19:07:52,244 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 566 flow [2024-11-07 19:07:52,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=566, PETRI_PLACES=97, PETRI_TRANSITIONS=111} [2024-11-07 19:07:52,245 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2024-11-07 19:07:52,245 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 566 flow [2024-11-07 19:07:52,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:52,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:52,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:52,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-07 19:07:52,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:52,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:52,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1308458934, now seen corresponding path program 1 times [2024-11-07 19:07:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509318696] [2024-11-07 19:07:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:52,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:52,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:07:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:52,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:07:52,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:52,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:52,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:52,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:52,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509318696] [2024-11-07 19:07:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509318696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:52,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:52,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:07:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812853557] [2024-11-07 19:07:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:52,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:07:52,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:52,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:07:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:07:52,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:52,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 111 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:52,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:52,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:52,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:07:56,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([228] L744-->readerEXIT: Formula: (and (= (_ bv0 32) |v_readerThread1of1ForFork2_#res#1.offset_1|) (= |v_readerThread1of1ForFork2_#res#1.base_1| (_ bv0 32))) InVars {} OutVars{readerThread1of1ForFork2_#res#1.base=|v_readerThread1of1ForFork2_#res#1.base_1|, readerThread1of1ForFork2_#res#1.offset=|v_readerThread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork2_#res#1.offset, readerThread1of1ForFork2_#res#1.base][284], [368#(and (= (_ bv0 32) |readerThread1of1ForFork1_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork1_~lx~0#1|)), Black: 120#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 110#(and (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|)), Black: 122#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 128#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~lx~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 32#L753-1true, Black: 98#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 118#(and (= ~x~0 (_ bv0 32)) (= ~y~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), Black: 126#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork2_~ly~0#1|) (= (_ bv0 32) |readerThread1of1ForFork2_~l~0#1|)), 300#(and (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|)), 187#true, Black: 211#(= ~r~0 (_ bv1 32)), 10#writerEXITtrue, 74#true, 7#L744true, 13#readerEXITtrue, Black: 152#(= ~w~0 (_ bv1 32)), Black: 298#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|)), Black: 303#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 (_ bv3 32))), Black: 294#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32))), Black: 274#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= ~x~0 (_ bv3 32))), Black: 296#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~y~0 (_ bv3 32)) (= ~x~0 (_ bv3 32))), Black: 306#(and (= (_ bv3 32) |readerThread1of1ForFork2_~l~0#1|) (= (_ bv3 32) |readerThread1of1ForFork2_~ly~0#1|) (= ~x~0 (_ bv3 32)) (= (_ bv3 32) |readerThread1of1ForFork2_~lx~0#1|))]) [2024-11-07 19:07:56,404 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-07 19:07:56,404 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:07:56,404 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:07:56,405 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-07 19:07:56,422 INFO L124 PetriNetUnfolderBase]: 34967/58050 cut-off events. [2024-11-07 19:07:56,422 INFO L125 PetriNetUnfolderBase]: For 66113/67929 co-relation queries the response was YES. [2024-11-07 19:07:56,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146170 conditions, 58050 events. 34967/58050 cut-off events. For 66113/67929 co-relation queries the response was YES. Maximal size of possible extension queue 3173. Compared 532623 event pairs, 17574 based on Foata normal form. 1045/56147 useless extension candidates. Maximal degree in co-relation 125678. Up to 35520 conditions per place. [2024-11-07 19:07:56,858 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 156 selfloop transitions, 107 changer transitions 0/299 dead transitions. [2024-11-07 19:07:56,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 299 transitions, 2074 flow [2024-11-07 19:07:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:07:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-07 19:07:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 466 transitions. [2024-11-07 19:07:56,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5781637717121588 [2024-11-07 19:07:56,862 INFO L175 Difference]: Start difference. First operand has 97 places, 111 transitions, 566 flow. Second operand 13 states and 466 transitions. [2024-11-07 19:07:56,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 299 transitions, 2074 flow [2024-11-07 19:07:57,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 299 transitions, 1972 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-07 19:07:57,403 INFO L231 Difference]: Finished difference. Result has 116 places, 194 transitions, 1368 flow [2024-11-07 19:07:57,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1368, PETRI_PLACES=116, PETRI_TRANSITIONS=194} [2024-11-07 19:07:57,404 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 50 predicate places. [2024-11-07 19:07:57,404 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 194 transitions, 1368 flow [2024-11-07 19:07:57,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:57,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:07:57,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:07:57,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2024-11-07 19:07:57,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:57,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:07:57,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:07:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1734772438, now seen corresponding path program 1 times [2024-11-07 19:07:57,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:07:57,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850468604] [2024-11-07 19:07:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:07:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:07:57,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:07:57,607 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:07:57,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:07:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:07:57,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:07:57,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:07:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:07:57,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:07:57,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:07:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850468604] [2024-11-07 19:07:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850468604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:07:57,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:07:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 19:07:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603783132] [2024-11-07 19:07:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:07:57,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:07:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:07:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:07:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:07:57,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:07:57,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 194 transitions, 1368 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:07:57,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:07:57,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:07:57,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:08:04,893 INFO L124 PetriNetUnfolderBase]: 54474/91564 cut-off events. [2024-11-07 19:08:04,893 INFO L125 PetriNetUnfolderBase]: For 119080/121088 co-relation queries the response was YES. [2024-11-07 19:08:05,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246637 conditions, 91564 events. 54474/91564 cut-off events. For 119080/121088 co-relation queries the response was YES. Maximal size of possible extension queue 5284. Compared 913072 event pairs, 17416 based on Foata normal form. 2569/91891 useless extension candidates. Maximal degree in co-relation 229339. Up to 39563 conditions per place. [2024-11-07 19:08:05,784 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 240 selfloop transitions, 110 changer transitions 0/386 dead transitions. [2024-11-07 19:08:05,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 386 transitions, 2968 flow [2024-11-07 19:08:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:08:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:08:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 443 transitions. [2024-11-07 19:08:05,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6495601173020528 [2024-11-07 19:08:05,786 INFO L175 Difference]: Start difference. First operand has 116 places, 194 transitions, 1368 flow. Second operand 11 states and 443 transitions. [2024-11-07 19:08:05,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 386 transitions, 2968 flow [2024-11-07 19:08:07,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 386 transitions, 2962 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-11-07 19:08:07,981 INFO L231 Difference]: Finished difference. Result has 132 places, 217 transitions, 1806 flow [2024-11-07 19:08:07,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1806, PETRI_PLACES=132, PETRI_TRANSITIONS=217} [2024-11-07 19:08:07,982 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 66 predicate places. [2024-11-07 19:08:07,982 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 217 transitions, 1806 flow [2024-11-07 19:08:07,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:08:07,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:08:07,982 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:08:07,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2024-11-07 19:08:08,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:08:08,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:08:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:08:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -336258438, now seen corresponding path program 1 times [2024-11-07 19:08:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:08:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183455767] [2024-11-07 19:08:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:08:08,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:08:08,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:08:08,186 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:08:08,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 19:08:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:08:08,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:08:08,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:08:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:08:08,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:08:08,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:08:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183455767] [2024-11-07 19:08:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183455767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:08:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:08:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:08:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243069239] [2024-11-07 19:08:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:08:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:08:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:08:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:08:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:08:08,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:08:08,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 217 transitions, 1806 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:08:08,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:08:08,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:08:08,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:08:16,452 INFO L124 PetriNetUnfolderBase]: 59179/100345 cut-off events. [2024-11-07 19:08:16,453 INFO L125 PetriNetUnfolderBase]: For 170982/172212 co-relation queries the response was YES. [2024-11-07 19:08:17,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289002 conditions, 100345 events. 59179/100345 cut-off events. For 170982/172212 co-relation queries the response was YES. Maximal size of possible extension queue 5761. Compared 1023846 event pairs, 32693 based on Foata normal form. 1401/99630 useless extension candidates. Maximal degree in co-relation 262452. Up to 73342 conditions per place. [2024-11-07 19:08:17,492 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 164 selfloop transitions, 134 changer transitions 0/334 dead transitions. [2024-11-07 19:08:17,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 334 transitions, 3057 flow [2024-11-07 19:08:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:08:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:08:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 401 transitions. [2024-11-07 19:08:17,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5879765395894428 [2024-11-07 19:08:17,495 INFO L175 Difference]: Start difference. First operand has 132 places, 217 transitions, 1806 flow. Second operand 11 states and 401 transitions. [2024-11-07 19:08:17,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 334 transitions, 3057 flow [2024-11-07 19:08:21,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 334 transitions, 2890 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-11-07 19:08:21,311 INFO L231 Difference]: Finished difference. Result has 143 places, 247 transitions, 2257 flow [2024-11-07 19:08:21,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2257, PETRI_PLACES=143, PETRI_TRANSITIONS=247} [2024-11-07 19:08:21,312 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 77 predicate places. [2024-11-07 19:08:21,312 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 247 transitions, 2257 flow [2024-11-07 19:08:21,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:08:21,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:08:21,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:08:21,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 19:08:21,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:08:21,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:08:21,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:08:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1647609722, now seen corresponding path program 1 times [2024-11-07 19:08:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:08:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245379899] [2024-11-07 19:08:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:08:21,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:08:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:08:21,516 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:08:21,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 19:08:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:08:21,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:08:21,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:08:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:08:21,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:08:21,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:08:21,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245379899] [2024-11-07 19:08:21,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245379899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:08:21,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:08:21,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 19:08:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366150694] [2024-11-07 19:08:21,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:08:21,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 19:08:21,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:08:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 19:08:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:08:21,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 62 [2024-11-07 19:08:21,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 247 transitions, 2257 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:08:21,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:08:21,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 62 [2024-11-07 19:08:21,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:08:30,405 INFO L124 PetriNetUnfolderBase]: 62631/106161 cut-off events. [2024-11-07 19:08:30,405 INFO L125 PetriNetUnfolderBase]: For 214332/215848 co-relation queries the response was YES. [2024-11-07 19:08:31,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306520 conditions, 106161 events. 62631/106161 cut-off events. For 214332/215848 co-relation queries the response was YES. Maximal size of possible extension queue 6157. Compared 1093191 event pairs, 34373 based on Foata normal form. 1501/105633 useless extension candidates. Maximal degree in co-relation 282839. Up to 78757 conditions per place. [2024-11-07 19:08:31,868 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 165 selfloop transitions, 158 changer transitions 0/365 dead transitions. [2024-11-07 19:08:31,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 365 transitions, 3584 flow [2024-11-07 19:08:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 19:08:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-07 19:08:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 400 transitions. [2024-11-07 19:08:31,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5865102639296188 [2024-11-07 19:08:31,869 INFO L175 Difference]: Start difference. First operand has 143 places, 247 transitions, 2257 flow. Second operand 11 states and 400 transitions. [2024-11-07 19:08:31,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 365 transitions, 3584 flow [2024-11-07 19:08:35,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 365 transitions, 3449 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-11-07 19:08:35,666 INFO L231 Difference]: Finished difference. Result has 152 places, 277 transitions, 2812 flow [2024-11-07 19:08:35,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2152, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2812, PETRI_PLACES=152, PETRI_TRANSITIONS=277} [2024-11-07 19:08:35,667 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 86 predicate places. [2024-11-07 19:08:35,667 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 277 transitions, 2812 flow [2024-11-07 19:08:35,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:08:35,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 19:08:35,668 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] [2024-11-07 19:08:35,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 19:08:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:08:35,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-11-07 19:08:35,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:08:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash -876760859, now seen corresponding path program 1 times [2024-11-07 19:08:35,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:08:35,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085595874] [2024-11-07 19:08:35,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:08:35,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:08:35,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:08:35,871 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:08:35,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (10)] Waiting until timeout for monitored process [2024-11-07 19:08:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:08:35,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 19:08:35,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:08:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:08:35,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:08:35,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:08:35,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085595874] [2024-11-07 19:08:35,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085595874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:08:35,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:08:35,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:08:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881775549] [2024-11-07 19:08:35,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:08:35,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:08:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:08:35,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:08:35,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:08:35,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 62 [2024-11-07 19:08:35,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 277 transitions, 2812 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:08:35,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 19:08:35,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 62 [2024-11-07 19:08:35,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 19:08:37,730 INFO L124 PetriNetUnfolderBase]: 11847/23693 cut-off events. [2024-11-07 19:08:37,730 INFO L125 PetriNetUnfolderBase]: For 36731/38314 co-relation queries the response was YES.