./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix043.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix043.oepc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:27:56,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:27:56,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:27:56,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:27:56,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:27:56,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:27:56,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:27:56,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:27:56,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:27:56,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:27:56,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:27:56,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:27:56,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:27:56,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:27:56,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:27:56,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:27:56,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:27:56,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:27:56,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:27:56,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:27:56,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:27:56,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:27:56,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:27:56,699 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 ! call(reach_error())) ) 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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2025-01-09 16:27:56,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:27:56,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:27:56,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:27:56,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:27:56,929 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:27:56,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2025-01-09 16:27:58,114 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e700c9eb/badad693175d469d8004024e50e5753d/FLAG400d04f78 [2025-01-09 16:27:58,430 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:27:58,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2025-01-09 16:27:58,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e700c9eb/badad693175d469d8004024e50e5753d/FLAG400d04f78 [2025-01-09 16:27:58,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e700c9eb/badad693175d469d8004024e50e5753d [2025-01-09 16:27:58,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:27:58,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:27:58,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:27:58,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:27:58,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:27:58,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:58" (1/1) ... [2025-01-09 16:27:58,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b77f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:58, skipping insertion in model container [2025-01-09 16:27:58,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:58" (1/1) ... [2025-01-09 16:27:58,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:27:58,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.oepc.i[945,958] [2025-01-09 16:27:58,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:27:58,996 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:27:59,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix043.oepc.i[945,958] [2025-01-09 16:27:59,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:27:59,074 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:27:59,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59 WrapperNode [2025-01-09 16:27:59,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:27:59,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:27:59,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:27:59,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:27:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,113 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 16:27:59,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:27:59,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:27:59,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:27:59,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:27:59,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,136 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]. [2025-01-09 16:27:59,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:27:59,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:27:59,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:27:59,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:27:59,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (1/1) ... [2025-01-09 16:27:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:27:59,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:27:59,181 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) [2025-01-09 16:27:59,183 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 [2025-01-09 16:27:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:27:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:27:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:27:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:27:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:27:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:27:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:27:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:27:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-09 16:27:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-09 16:27:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:27:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:27:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:27:59,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:27:59,205 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:27:59,303 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:27:59,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:27:59,563 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:27:59,563 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:27:59,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:27:59,720 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:27:59,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:59 BoogieIcfgContainer [2025-01-09 16:27:59,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:27:59,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:27:59,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:27:59,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:27:59,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:27:58" (1/3) ... [2025-01-09 16:27:59,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3b0585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:59, skipping insertion in model container [2025-01-09 16:27:59,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:59" (2/3) ... [2025-01-09 16:27:59,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3b0585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:59, skipping insertion in model container [2025-01-09 16:27:59,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:59" (3/3) ... [2025-01-09 16:27:59,728 INFO L128 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2025-01-09 16:27:59,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:27:59,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix043.oepc.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 16:27:59,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:27:59,793 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:27:59,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2025-01-09 16:27:59,846 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2025-01-09 16:27:59,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:27:59,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2025-01-09 16:27:59,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2025-01-09 16:27:59,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2025-01-09 16:27:59,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:27:59,869 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=LoopHeads, 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;@25be2467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:27:59,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 16:27:59,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:27:59,873 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-01-09 16:27:59,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:27:59,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:27:59,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-09 16:27:59,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:27:59,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:27:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash 12056438, now seen corresponding path program 1 times [2025-01-09 16:27:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:27:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346374869] [2025-01-09 16:27:59,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:27:59,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:27:59,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 16:27:59,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 16:27:59,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:27:59,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:00,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346374869] [2025-01-09 16:28:00,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346374869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:00,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:00,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 16:28:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427512393] [2025-01-09 16:28:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:28:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:00,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:28:00,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:28:00,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2025-01-09 16:28:00,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-01-09 16:28:00,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:00,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2025-01-09 16:28:00,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:00,939 INFO L124 PetriNetUnfolderBase]: 2495/3975 cut-off events. [2025-01-09 16:28:00,939 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 16:28:00,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7551 conditions, 3975 events. 2495/3975 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 25027 event pairs, 1647 based on Foata normal form. 135/4039 useless extension candidates. Maximal degree in co-relation 7539. Up to 2779 conditions per place. [2025-01-09 16:28:00,976 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2025-01-09 16:28:00,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 227 flow [2025-01-09 16:28:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:28:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:28:00,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-01-09 16:28:00,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7933333333333333 [2025-01-09 16:28:00,993 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 119 transitions. [2025-01-09 16:28:00,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 227 flow [2025-01-09 16:28:00,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:01,002 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2025-01-09 16:28:01,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-01-09 16:28:01,009 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-01-09 16:28:01,010 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2025-01-09 16:28:01,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2025-01-09 16:28:01,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:01,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:01,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:28:01,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:01,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2058737664, now seen corresponding path program 1 times [2025-01-09 16:28:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577692652] [2025-01-09 16:28:01,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:01,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:28:01,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:28:01,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:01,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577692652] [2025-01-09 16:28:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577692652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:01,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:01,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:28:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847882327] [2025-01-09 16:28:01,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:28:01,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:01,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:28:01,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:28:01,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:01,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2025-01-09 16:28:01,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:01,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:01,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:02,501 INFO L124 PetriNetUnfolderBase]: 7779/12179 cut-off events. [2025-01-09 16:28:02,501 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-01-09 16:28:02,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23595 conditions, 12179 events. 7779/12179 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 87349 event pairs, 1033 based on Foata normal form. 400/11957 useless extension candidates. Maximal degree in co-relation 23585. Up to 5841 conditions per place. [2025-01-09 16:28:02,581 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 52 selfloop transitions, 6 changer transitions 1/75 dead transitions. [2025-01-09 16:28:02,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 290 flow [2025-01-09 16:28:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:28:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:28:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-09 16:28:02,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.705 [2025-01-09 16:28:02,583 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 141 transitions. [2025-01-09 16:28:02,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 290 flow [2025-01-09 16:28:02,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:02,587 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2025-01-09 16:28:02,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-01-09 16:28:02,588 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2025-01-09 16:28:02,588 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2025-01-09 16:28:02,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2025-01-09 16:28:02,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:02,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:28:02,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:02,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1906851282, now seen corresponding path program 1 times [2025-01-09 16:28:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167946048] [2025-01-09 16:28:02,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:02,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:28:02,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:28:02,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:02,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:02,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167946048] [2025-01-09 16:28:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167946048] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:02,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:28:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145024619] [2025-01-09 16:28:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:02,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:28:02,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:02,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:28:02,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:28:02,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:02,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2025-01-09 16:28:02,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:02,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:02,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:03,678 INFO L124 PetriNetUnfolderBase]: 6075/9479 cut-off events. [2025-01-09 16:28:03,678 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2025-01-09 16:28:03,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21263 conditions, 9479 events. 6075/9479 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 63907 event pairs, 451 based on Foata normal form. 364/9402 useless extension candidates. Maximal degree in co-relation 21251. Up to 3681 conditions per place. [2025-01-09 16:28:03,717 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 67 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2025-01-09 16:28:03,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 415 flow [2025-01-09 16:28:03,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:28:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:28:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-01-09 16:28:03,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-01-09 16:28:03,719 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 180 transitions. [2025-01-09 16:28:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 415 flow [2025-01-09 16:28:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:03,726 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2025-01-09 16:28:03,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-01-09 16:28:03,727 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-01-09 16:28:03,727 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2025-01-09 16:28:03,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2025-01-09 16:28:03,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:03,728 INFO L206 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] [2025-01-09 16:28:03,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:28:03,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -15923201, now seen corresponding path program 1 times [2025-01-09 16:28:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629343917] [2025-01-09 16:28:03,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:03,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:28:03,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:28:03,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:03,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629343917] [2025-01-09 16:28:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629343917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:03,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:03,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:28:03,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093669951] [2025-01-09 16:28:03,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:03,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:03,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:03,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:03,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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) [2025-01-09 16:28:03,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:03,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:03,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:04,641 INFO L124 PetriNetUnfolderBase]: 4027/6127 cut-off events. [2025-01-09 16:28:04,641 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2025-01-09 16:28:04,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15577 conditions, 6127 events. 4027/6127 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 35955 event pairs, 289 based on Foata normal form. 244/6113 useless extension candidates. Maximal degree in co-relation 15563. Up to 1788 conditions per place. [2025-01-09 16:28:04,672 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 80 selfloop transitions, 14 changer transitions 1/111 dead transitions. [2025-01-09 16:28:04,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 111 transitions, 546 flow [2025-01-09 16:28:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-01-09 16:28:04,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7233333333333334 [2025-01-09 16:28:04,674 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 217 transitions. [2025-01-09 16:28:04,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 111 transitions, 546 flow [2025-01-09 16:28:04,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 516 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 16:28:04,691 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2025-01-09 16:28:04,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-01-09 16:28:04,692 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-01-09 16:28:04,692 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2025-01-09 16:28:04,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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) [2025-01-09 16:28:04,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:04,693 INFO L206 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, 1, 1] [2025-01-09 16:28:04,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:28:04,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:04,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1398788504, now seen corresponding path program 1 times [2025-01-09 16:28:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746888807] [2025-01-09 16:28:04,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:04,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:28:04,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:28:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:04,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746888807] [2025-01-09 16:28:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746888807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:04,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980027286] [2025-01-09 16:28:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:04,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:28:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:04,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:28:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:28:04,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-01-09 16:28:04,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2025-01-09 16:28:04,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:04,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-01-09 16:28:04,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:05,578 INFO L124 PetriNetUnfolderBase]: 2863/4175 cut-off events. [2025-01-09 16:28:05,579 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2025-01-09 16:28:05,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11602 conditions, 4175 events. 2863/4175 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 21757 event pairs, 231 based on Foata normal form. 96/4100 useless extension candidates. Maximal degree in co-relation 11587. Up to 1316 conditions per place. [2025-01-09 16:28:05,601 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 71 selfloop transitions, 18 changer transitions 1/106 dead transitions. [2025-01-09 16:28:05,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 536 flow [2025-01-09 16:28:05,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:28:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:28:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2025-01-09 16:28:05,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2025-01-09 16:28:05,603 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 232 transitions. [2025-01-09 16:28:05,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 536 flow [2025-01-09 16:28:05,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-01-09 16:28:05,627 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2025-01-09 16:28:05,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-01-09 16:28:05,628 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-01-09 16:28:05,628 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2025-01-09 16:28:05,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2025-01-09 16:28:05,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:05,628 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:05,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:28:05,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:05,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:05,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2052048850, now seen corresponding path program 1 times [2025-01-09 16:28:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463749249] [2025-01-09 16:28:05,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:28:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:05,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:05,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:05,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:05,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:07,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463749249] [2025-01-09 16:28:07,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463749249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:07,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:07,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:28:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765964125] [2025-01-09 16:28:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:07,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:28:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:07,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:28:07,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:28:07,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 50 [2025-01-09 16:28:07,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 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) [2025-01-09 16:28:07,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:07,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 50 [2025-01-09 16:28:07,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:08,549 INFO L124 PetriNetUnfolderBase]: 11804/18261 cut-off events. [2025-01-09 16:28:08,549 INFO L125 PetriNetUnfolderBase]: For 8305/8688 co-relation queries the response was YES. [2025-01-09 16:28:08,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43378 conditions, 18261 events. 11804/18261 cut-off events. For 8305/8688 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 130095 event pairs, 2056 based on Foata normal form. 16/17689 useless extension candidates. Maximal degree in co-relation 43362. Up to 4878 conditions per place. [2025-01-09 16:28:08,660 INFO L140 encePairwiseOnDemand]: 35/50 looper letters, 115 selfloop transitions, 33 changer transitions 14/188 dead transitions. [2025-01-09 16:28:08,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 188 transitions, 898 flow [2025-01-09 16:28:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:28:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:28:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 361 transitions. [2025-01-09 16:28:08,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6563636363636364 [2025-01-09 16:28:08,662 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 11 states and 361 transitions. [2025-01-09 16:28:08,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 188 transitions, 898 flow [2025-01-09 16:28:08,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 188 transitions, 772 flow, removed 32 selfloop flow, removed 10 redundant places. [2025-01-09 16:28:08,878 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 410 flow [2025-01-09 16:28:08,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2025-01-09 16:28:08,880 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-01-09 16:28:08,881 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 410 flow [2025-01-09 16:28:08,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 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) [2025-01-09 16:28:08,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:08,881 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:08,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:28:08,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:08,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1287791540, now seen corresponding path program 2 times [2025-01-09 16:28:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490154761] [2025-01-09 16:28:08,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:28:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:08,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:08,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:08,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:28:08,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490154761] [2025-01-09 16:28:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490154761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42362454] [2025-01-09 16:28:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:09,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:09,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:09,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:28:09,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2025-01-09 16:28:09,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:09,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:28:09,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:09,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 32#L775true, 63#true, 84#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 12#$Ultimate##0true]) [2025-01-09 16:28:09,830 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-01-09 16:28:09,830 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:28:09,830 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:28:09,830 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-09 16:28:09,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 32#L775true, 63#true, 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 84#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, 17#L879true, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 12#$Ultimate##0true]) [2025-01-09 16:28:09,958 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2025-01-09 16:28:09,958 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:28:09,958 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:28:09,958 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-09 16:28:10,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [24#P0EXITtrue, 59#true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 12#$Ultimate##0true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,185 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-01-09 16:28:10,185 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:28:10,185 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:28:10,185 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-01-09 16:28:10,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L785-->L788: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][41], [18#L788true, 154#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 59#true, 32#L775true, 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 84#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 19#L831true]) [2025-01-09 16:28:10,293 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2025-01-09 16:28:10,293 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2025-01-09 16:28:10,293 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2025-01-09 16:28:10,293 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2025-01-09 16:28:10,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [24#P0EXITtrue, 59#true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, 17#L879true, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 12#$Ultimate##0true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,324 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-01-09 16:28:10,324 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:28:10,324 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:28:10,324 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-01-09 16:28:10,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 32#L775true, 14#L795true, 63#true, 84#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 5#L878-4true, 57#true, Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true]) [2025-01-09 16:28:10,429 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-01-09 16:28:10,429 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:10,429 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:10,429 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-09 16:28:10,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L785-->L788: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][41], [18#L788true, 154#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 59#true, 32#L775true, 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 84#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 57#true, Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 17#L879true, 51#P2EXITtrue, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 19#L831true]) [2025-01-09 16:28:10,430 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2025-01-09 16:28:10,430 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-01-09 16:28:10,431 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-01-09 16:28:10,431 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-01-09 16:28:10,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L785-->L788: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][41], [24#P0EXITtrue, 18#L788true, 154#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 59#true, 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 5#L878-4true, 57#true, Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 19#L831true]) [2025-01-09 16:28:10,549 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2025-01-09 16:28:10,549 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-01-09 16:28:10,549 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-01-09 16:28:10,549 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-01-09 16:28:10,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 14#L795true, 41#L778true, 63#true, 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, 51#P2EXITtrue, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,558 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 32#L775true, 14#L795true, 63#true, 84#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, 51#P2EXITtrue, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 17#L879true, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true]) [2025-01-09 16:28:10,568 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,568 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,568 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,568 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-09 16:28:10,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [24#P0EXITtrue, 59#true, 14#L795true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,795 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,795 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,795 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,795 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L785-->L788: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0][41], [24#P0EXITtrue, 18#L788true, 154#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 59#true, 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 57#true, Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 51#P2EXITtrue, 17#L879true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 19#L831true]) [2025-01-09 16:28:10,795 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2025-01-09 16:28:10,795 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-01-09 16:28:10,795 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-01-09 16:28:10,795 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-01-09 16:28:10,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 14#L795true, 41#L778true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, 17#L879true, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,810 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,810 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,810 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,810 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 32#L775true, 63#true, 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 5#L878-4true, 57#true, Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 28#P1EXITtrue, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,830 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,830 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,830 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,831 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-01-09 16:28:10,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [24#P0EXITtrue, 59#true, 14#L795true, 63#true, 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 43#L847true, Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, 17#L879true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:10,971 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,971 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,971 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,971 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 41#L778true, 63#true, 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 149#(= ~y~0 1), 43#L847true, Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, 51#P2EXITtrue, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 115#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 28#P1EXITtrue]) [2025-01-09 16:28:10,991 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,991 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,991 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:10,991 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:11,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 32#L775true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 149#(= ~y~0 1), 43#L847true, Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, 51#P2EXITtrue, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 17#L879true, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 28#P1EXITtrue, 98#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0))]) [2025-01-09 16:28:11,007 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-01-09 16:28:11,007 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:11,007 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:11,007 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-01-09 16:28:11,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [24#P0EXITtrue, 59#true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 149#(= ~y~0 1), 43#L847true, Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 5#L878-4true, 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, 115#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 28#P1EXITtrue]) [2025-01-09 16:28:11,117 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,117 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,117 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,117 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [59#true, 41#L778true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 149#(= ~y~0 1), 43#L847true, Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, 115#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 17#L879true, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 28#P1EXITtrue]) [2025-01-09 16:28:11,129 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,129 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,129 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,129 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-01-09 16:28:11,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([405] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse8 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse8)) (.cse9 (and .cse4 .cse8)) (.cse12 (= (mod v_~b$w_buff0_used~0_138 256) 0)) (.cse5 (= (mod v_~weak$$choice2~0_30 256) 0))) (let ((.cse1 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse0 (not .cse5)) (.cse3 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse6 (or .cse11 .cse9 .cse12)) (.cse7 (and .cse10 (not .cse12)))) (and (= v_~b$r_buff1_thd4~0_65 (ite (= (mod (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse2 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~b$r_buff1_thd4~0_66 0)) 256) 0) 0 1)) (= v_~b~0_72 (ite (not (= (mod (ite .cse5 0 1) 256) 0)) v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)) (= v_~b$flush_delayed~0_33 0) (= (ite (= (mod (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse6 v_~b$w_buff0_used~0_138 (ite .cse7 0 v_~b$w_buff0_used~0_138))) 256) 0) 0 1) v_~b$w_buff0_used~0_137) (= (ite (= (mod (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse1 .cse8) .cse3 .cse9) v_~b$r_buff0_thd4~0_68 (ite (and .cse10 (not .cse3)) 0 v_~b$r_buff0_thd4~0_68))) 256) 0) 0 1) v_~b$r_buff0_thd4~0_67) (= (ite (= (mod (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse11 .cse3 .cse9) v_~b$w_buff1_used~0_127 0)) 256) 0) 0 1) v_~b$w_buff1_used~0_126) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= (ite (= (mod |v_P3_#t~nondet3_19| 256) 0) 0 1) v_~weak$$choice0~0_7) (or (= |v_P3_#t~nondet3_19| 1) (= |v_P3_#t~nondet3_19| 0)) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse6 v_~b~0_73 (ite .cse7 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (or (= |v_P3_#t~nondet4_27| 0) (= |v_P3_#t~nondet4_27| 1)) (= (ite (= (mod |v_P3_#t~nondet4_27| 256) 0) 0 1) v_~weak$$choice2~0_30))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[|v_P3_#t~nondet3_19|, |v_P3_#t~nondet4_27|] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][105], [24#P0EXITtrue, 59#true, 63#true, Black: 120#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0)), 133#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 43#L847true, Black: 122#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (<= 0 (div ~b$w_buff0_used~0 256)) (<= (mod ~b$w_buff0_used~0 256) 0) (not (= ~b~0 0)) (= 0 ~b$r_buff1_thd2~0)), 149#(= ~y~0 1), Black: 137#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 131#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), Black: 135#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 129#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (= ~b$r_buff0_thd3~0 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 57#true, 115#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 17#L879true, Black: 125#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 51#P2EXITtrue, Black: 121#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (= ~b$r_buff0_thd2~0 0) (= ~b~0 0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd3~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff0_used~0 1) (= 0 ~b$r_buff1_thd2~0)), 61#true, 28#P1EXITtrue]) [2025-01-09 16:28:11,213 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-01-09 16:28:11,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:28:11,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:28:11,213 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-01-09 16:28:11,423 INFO L124 PetriNetUnfolderBase]: 17688/28910 cut-off events. [2025-01-09 16:28:11,423 INFO L125 PetriNetUnfolderBase]: For 26979/28188 co-relation queries the response was YES. [2025-01-09 16:28:11,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78048 conditions, 28910 events. 17688/28910 cut-off events. For 26979/28188 co-relation queries the response was YES. Maximal size of possible extension queue 1596. Compared 241531 event pairs, 4268 based on Foata normal form. 548/27671 useless extension candidates. Maximal degree in co-relation 78028. Up to 10316 conditions per place. [2025-01-09 16:28:11,587 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 59 selfloop transitions, 3 changer transitions 51/154 dead transitions. [2025-01-09 16:28:11,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 154 transitions, 896 flow [2025-01-09 16:28:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-01-09 16:28:11,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-01-09 16:28:11,588 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 410 flow. Second operand 6 states and 190 transitions. [2025-01-09 16:28:11,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 154 transitions, 896 flow [2025-01-09 16:28:11,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 154 transitions, 890 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:28:11,623 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 407 flow [2025-01-09 16:28:11,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2025-01-09 16:28:11,624 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-01-09 16:28:11,624 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 407 flow [2025-01-09 16:28:11,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2025-01-09 16:28:11,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:11,624 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:11,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:28:11,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1400149616, now seen corresponding path program 3 times [2025-01-09 16:28:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983532544] [2025-01-09 16:28:11,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:28:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:11,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:11,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:11,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:28:11,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:28:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:28:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:28:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983532544] [2025-01-09 16:28:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983532544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:28:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:28:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:28:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444068776] [2025-01-09 16:28:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:28:11,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:28:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:28:11,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:28:11,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:28:11,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2025-01-09 16:28:11,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 407 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2025-01-09 16:28:11,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:28:11,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2025-01-09 16:28:11,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:28:15,141 INFO L124 PetriNetUnfolderBase]: 26937/43578 cut-off events. [2025-01-09 16:28:15,141 INFO L125 PetriNetUnfolderBase]: For 40439/42027 co-relation queries the response was YES. [2025-01-09 16:28:15,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116813 conditions, 43578 events. 26937/43578 cut-off events. For 40439/42027 co-relation queries the response was YES. Maximal size of possible extension queue 2603. Compared 382148 event pairs, 8690 based on Foata normal form. 277/40571 useless extension candidates. Maximal degree in co-relation 116790. Up to 16008 conditions per place. [2025-01-09 16:28:15,363 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 36 selfloop transitions, 1 changer transitions 77/147 dead transitions. [2025-01-09 16:28:15,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 147 transitions, 860 flow [2025-01-09 16:28:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:28:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:28:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2025-01-09 16:28:15,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-01-09 16:28:15,365 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 407 flow. Second operand 6 states and 193 transitions. [2025-01-09 16:28:15,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 147 transitions, 860 flow [2025-01-09 16:28:15,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 147 transitions, 853 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:28:15,511 INFO L231 Difference]: Finished difference. Result has 85 places, 63 transitions, 285 flow [2025-01-09 16:28:15,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=85, PETRI_TRANSITIONS=63} [2025-01-09 16:28:15,511 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-01-09 16:28:15,511 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 63 transitions, 285 flow [2025-01-09 16:28:15,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2025-01-09 16:28:15,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:28:15,511 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:28:15,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:28:15,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:28:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:28:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 702854480, now seen corresponding path program 4 times [2025-01-09 16:28:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:28:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167569362] [2025-01-09 16:28:15,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:28:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:28:15,522 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-09 16:28:15,720 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:15,720 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:28:15,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:28:15,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:28:15,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 16:28:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 16:28:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:28:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:28:15,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:28:15,831 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:28:15,831 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-01-09 16:28:15,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-01-09 16:28:15,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 16:28:15,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-09 16:28:15,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-09 16:28:15,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-09 16:28:15,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-01-09 16:28:15,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:28:15,834 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-01-09 16:28:15,937 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:28:15,937 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:28:15,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:28:15 BasicIcfg [2025-01-09 16:28:15,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:28:15,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:28:15,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:28:15,941 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:28:15,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:59" (3/4) ... [2025-01-09 16:28:15,942 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:28:16,048 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-09 16:28:16,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:28:16,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:28:16,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:28:16,089 INFO L158 Benchmark]: Toolchain (without parser) took 17397.12ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 115.1MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 688.9MB. Max. memory is 16.1GB. [2025-01-09 16:28:16,089 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:16,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.47ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 91.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:28:16,090 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:28:16,090 INFO L158 Benchmark]: Boogie Preprocessor took 38.06ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 85.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:28:16,090 INFO L158 Benchmark]: RCFGBuilder took 568.92ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 98.4MB in the end (delta: -13.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-01-09 16:28:16,091 INFO L158 Benchmark]: TraceAbstraction took 16218.08ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 97.6MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 649.5MB. Max. memory is 16.1GB. [2025-01-09 16:28:16,091 INFO L158 Benchmark]: Witness Printer took 146.80ms. Allocated memory is still 4.3GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:28:16,092 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.47ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 91.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.06ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 85.3MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 568.92ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 98.4MB in the end (delta: -13.0MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16218.08ms. Allocated memory was 142.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 97.6MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 649.5MB. Max. memory is 16.1GB. * Witness Printer took 146.80ms. Allocated memory is still 4.3GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, t1130=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129=-3, t1130=-2, t1131=-1, t1132=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 872]: 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: 876]: 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 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 668 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 278 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 243 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1372 IncrementalHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 35 mSDtfsCounter, 1372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=6, InterpolantAutomatonStates: 48, 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.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:28:16,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE