./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:25:07,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:25:07,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:25:07,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:25:07,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:25:07,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:25:07,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:25:07,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:25:07,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:25:07,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:25:07,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:25:07,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:25:07,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:25:07,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:25:07,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:25:07,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:25:07,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:25:07,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:25:07,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:25:07,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:25:07,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:25:07,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:25:07,211 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:25:07,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:25:07,211 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:25:07,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:25:07,212 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:25:07,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:25:07,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:25:07,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:25:07,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:25:07,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:25:07,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:25:07,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:25:07,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:25:07,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:25:07,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:25:07,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:25:07,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:25:07,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:25:07,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:25:07,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:25:07,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2024-11-19 09:25:07,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:25:07,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:25:07,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:25:07,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:25:07,473 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:25:07,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2024-11-19 09:25:08,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:25:08,886 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:25:08,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2024-11-19 09:25:08,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa9b7516/10cc547bb3104ec784dc38301ade1985/FLAG0f941bffc [2024-11-19 09:25:09,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fa9b7516/10cc547bb3104ec784dc38301ade1985 [2024-11-19 09:25:09,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:25:09,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:25:09,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:25:09,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:25:09,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:25:09,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bdcb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09, skipping insertion in model container [2024-11-19 09:25:09,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:25:09,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:25:09,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:25:09,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:25:09,702 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:25:09,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09 WrapperNode [2024-11-19 09:25:09,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:25:09,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:25:09,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:25:09,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:25:09,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,764 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2024-11-19 09:25:09,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:25:09,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:25:09,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:25:09,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:25:09,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,806 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:25:09,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:25:09,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:25:09,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:25:09,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:25:09,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (1/1) ... [2024-11-19 09:25:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:25:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:25:09,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:25:09,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:25:09,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:25:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:25:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:25:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:25:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:25:09,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:25:09,907 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:25:09,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:25:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-19 09:25:09,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-19 09:25:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:25:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:25:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:25:09,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:25:09,910 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:25:10,020 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:25:10,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:25:10,297 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:25:10,297 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:25:10,497 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:25:10,498 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:25:10,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:25:10 BoogieIcfgContainer [2024-11-19 09:25:10,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:25:10,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:25:10,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:25:10,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:25:10,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:25:09" (1/3) ... [2024-11-19 09:25:10,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384e1dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:25:10, skipping insertion in model container [2024-11-19 09:25:10,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:09" (2/3) ... [2024-11-19 09:25:10,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384e1dcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:25:10, skipping insertion in model container [2024-11-19 09:25:10,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:25:10" (3/3) ... [2024-11-19 09:25:10,508 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2024-11-19 09:25:10,523 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:25:10,523 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:25:10,523 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:25:10,569 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:25:10,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-19 09:25:10,627 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-19 09:25:10,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:10,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-19 09:25:10,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-19 09:25:10,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-19 09:25:10,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:25:10,650 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cd6add2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:25:10,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 09:25:10,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:25:10,659 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-19 09:25:10,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:10,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:10,660 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:10,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:10,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash -951107217, now seen corresponding path program 1 times [2024-11-19 09:25:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944280836] [2024-11-19 09:25:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:10,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:11,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944280836] [2024-11-19 09:25:11,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944280836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:11,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:11,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:25:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781593729] [2024-11-19 09:25:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:25:11,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:11,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:25:11,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:25:11,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-19 09:25:11,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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) [2024-11-19 09:25:11,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:11,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-19 09:25:11,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:11,493 INFO L124 PetriNetUnfolderBase]: 1175/2001 cut-off events. [2024-11-19 09:25:11,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:11,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3737 conditions, 2001 events. 1175/2001 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14598 event pairs, 199 based on Foata normal form. 120/2080 useless extension candidates. Maximal degree in co-relation 3725. Up to 1361 conditions per place. [2024-11-19 09:25:11,514 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-19 09:25:11,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2024-11-19 09:25:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:25:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:25:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-19 09:25:11,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2024-11-19 09:25:11,527 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2024-11-19 09:25:11,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2024-11-19 09:25:11,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:11,535 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-19 09:25:11,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-19 09:25:11,541 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-19 09:25:11,542 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-19 09:25:11,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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) [2024-11-19 09:25:11,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:11,542 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:25:11,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1486059607, now seen corresponding path program 1 times [2024-11-19 09:25:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280286297] [2024-11-19 09:25:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:11,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:11,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280286297] [2024-11-19 09:25:11,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280286297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:11,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:11,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:25:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224859364] [2024-11-19 09:25:11,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:11,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:25:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:11,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:25:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:25:11,613 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-19 09:25:11,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:11,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:11,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-19 09:25:11,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:11,862 INFO L124 PetriNetUnfolderBase]: 1027/1865 cut-off events. [2024-11-19 09:25:11,862 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-19 09:25:11,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1865 events. 1027/1865 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14351 event pairs, 1027 based on Foata normal form. 60/1860 useless extension candidates. Maximal degree in co-relation 3465. Up to 1484 conditions per place. [2024-11-19 09:25:11,892 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-19 09:25:11,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 146 flow [2024-11-19 09:25:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:25:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:25:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-19 09:25:11,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-11-19 09:25:11,895 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 104 transitions. [2024-11-19 09:25:11,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 146 flow [2024-11-19 09:25:11,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:25:11,898 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2024-11-19 09:25:11,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-11-19 09:25:11,899 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-11-19 09:25:11,899 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2024-11-19 09:25:11,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:11,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:11,900 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:11,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:25:11,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1486060825, now seen corresponding path program 1 times [2024-11-19 09:25:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766959422] [2024-11-19 09:25:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:11,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766959422] [2024-11-19 09:25:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766959422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:12,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:25:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549236123] [2024-11-19 09:25:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:12,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:25:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:12,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:25:12,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:25:12,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-19 09:25:12,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:12,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:12,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-19 09:25:12,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:12,468 INFO L124 PetriNetUnfolderBase]: 1327/2237 cut-off events. [2024-11-19 09:25:12,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:12,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 2237 events. 1327/2237 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 16689 event pairs, 307 based on Foata normal form. 0/2160 useless extension candidates. Maximal degree in co-relation 4201. Up to 853 conditions per place. [2024-11-19 09:25:12,478 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 27 selfloop transitions, 2 changer transitions 36/86 dead transitions. [2024-11-19 09:25:12,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 312 flow [2024-11-19 09:25:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:25:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:25:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 275 transitions. [2024-11-19 09:25:12,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-19 09:25:12,481 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 275 transitions. [2024-11-19 09:25:12,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 312 flow [2024-11-19 09:25:12,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:25:12,483 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 111 flow [2024-11-19 09:25:12,483 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=8, PETRI_FLOW=111, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2024-11-19 09:25:12,485 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2024-11-19 09:25:12,486 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 111 flow [2024-11-19 09:25:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:12,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:12,486 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:25:12,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:12,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:12,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2131020118, now seen corresponding path program 1 times [2024-11-19 09:25:12,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:12,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112491681] [2024-11-19 09:25:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:12,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:12,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112491681] [2024-11-19 09:25:12,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112491681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:12,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:25:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162027337] [2024-11-19 09:25:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:12,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:25:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:25:12,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:25:12,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-19 09:25:12,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:12,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:12,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-19 09:25:12,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:13,061 INFO L124 PetriNetUnfolderBase]: 1427/2511 cut-off events. [2024-11-19 09:25:13,062 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2024-11-19 09:25:13,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5081 conditions, 2511 events. 1427/2511 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17039 event pairs, 401 based on Foata normal form. 54/2516 useless extension candidates. Maximal degree in co-relation 5069. Up to 1349 conditions per place. [2024-11-19 09:25:13,077 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 2 changer transitions 27/84 dead transitions. [2024-11-19 09:25:13,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 338 flow [2024-11-19 09:25:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:25:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:25:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 241 transitions. [2024-11-19 09:25:13,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625974025974026 [2024-11-19 09:25:13,080 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 111 flow. Second operand 7 states and 241 transitions. [2024-11-19 09:25:13,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 338 flow [2024-11-19 09:25:13,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 316 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-19 09:25:13,085 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 115 flow [2024-11-19 09:25:13,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-11-19 09:25:13,085 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2024-11-19 09:25:13,086 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 115 flow [2024-11-19 09:25:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:13,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:13,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:13,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:25:13,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 140782018, now seen corresponding path program 1 times [2024-11-19 09:25:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100302727] [2024-11-19 09:25:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:13,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100302727] [2024-11-19 09:25:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100302727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:13,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:13,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:25:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943529483] [2024-11-19 09:25:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:13,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:25:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:25:13,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:25:13,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:13,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:13,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:13,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:13,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:13,857 INFO L124 PetriNetUnfolderBase]: 4223/6312 cut-off events. [2024-11-19 09:25:13,858 INFO L125 PetriNetUnfolderBase]: For 700/700 co-relation queries the response was YES. [2024-11-19 09:25:13,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13345 conditions, 6312 events. 4223/6312 cut-off events. For 700/700 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 41344 event pairs, 603 based on Foata normal form. 216/6516 useless extension candidates. Maximal degree in co-relation 13332. Up to 3483 conditions per place. [2024-11-19 09:25:13,891 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 47 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-11-19 09:25:13,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 287 flow [2024-11-19 09:25:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:25:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:25:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-11-19 09:25:13,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2024-11-19 09:25:13,892 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 115 flow. Second operand 4 states and 148 transitions. [2024-11-19 09:25:13,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 287 flow [2024-11-19 09:25:13,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 275 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-19 09:25:13,907 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 145 flow [2024-11-19 09:25:13,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=145, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-11-19 09:25:13,909 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-11-19 09:25:13,910 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 145 flow [2024-11-19 09:25:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:13,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:13,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:13,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:25:13,910 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:13,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash -871353353, now seen corresponding path program 1 times [2024-11-19 09:25:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150879606] [2024-11-19 09:25:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150879606] [2024-11-19 09:25:14,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150879606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:14,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:25:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347575173] [2024-11-19 09:25:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:25:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:25:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:25:14,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:14,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:14,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:14,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:14,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:14,708 INFO L124 PetriNetUnfolderBase]: 3605/5432 cut-off events. [2024-11-19 09:25:14,708 INFO L125 PetriNetUnfolderBase]: For 1665/1671 co-relation queries the response was YES. [2024-11-19 09:25:14,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13172 conditions, 5432 events. 3605/5432 cut-off events. For 1665/1671 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 34196 event pairs, 213 based on Foata normal form. 210/5630 useless extension candidates. Maximal degree in co-relation 13161. Up to 2673 conditions per place. [2024-11-19 09:25:14,735 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 60 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-11-19 09:25:14,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 401 flow [2024-11-19 09:25:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:25:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:25:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-11-19 09:25:14,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6836363636363636 [2024-11-19 09:25:14,737 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 145 flow. Second operand 5 states and 188 transitions. [2024-11-19 09:25:14,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 401 flow [2024-11-19 09:25:14,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 390 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:25:14,739 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 197 flow [2024-11-19 09:25:14,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=197, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-11-19 09:25:14,740 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-11-19 09:25:14,740 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 197 flow [2024-11-19 09:25:14,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:14,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:14,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:25:14,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:14,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1075317448, now seen corresponding path program 1 times [2024-11-19 09:25:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138006408] [2024-11-19 09:25:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138006408] [2024-11-19 09:25:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138006408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:25:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097329768] [2024-11-19 09:25:14,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:14,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:14,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:14,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:14,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:14,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:15,341 INFO L124 PetriNetUnfolderBase]: 2467/3738 cut-off events. [2024-11-19 09:25:15,341 INFO L125 PetriNetUnfolderBase]: For 3177/3189 co-relation queries the response was YES. [2024-11-19 09:25:15,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10132 conditions, 3738 events. 2467/3738 cut-off events. For 3177/3189 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20922 event pairs, 81 based on Foata normal form. 168/3894 useless extension candidates. Maximal degree in co-relation 10119. Up to 1249 conditions per place. [2024-11-19 09:25:15,365 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 71 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-11-19 09:25:15,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 525 flow [2024-11-19 09:25:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 226 transitions. [2024-11-19 09:25:15,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6848484848484848 [2024-11-19 09:25:15,367 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 197 flow. Second operand 6 states and 226 transitions. [2024-11-19 09:25:15,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 525 flow [2024-11-19 09:25:15,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 495 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:15,373 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 247 flow [2024-11-19 09:25:15,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=60, 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=247, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-19 09:25:15,374 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-19 09:25:15,374 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 247 flow [2024-11-19 09:25:15,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:15,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:15,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:15,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:25:15,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash 904490955, now seen corresponding path program 1 times [2024-11-19 09:25:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772013826] [2024-11-19 09:25:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:15,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772013826] [2024-11-19 09:25:15,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772013826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:15,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:15,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:25:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117879873] [2024-11-19 09:25:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:25:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:25:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:25:15,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-19 09:25:15,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 247 flow. Second operand has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:15,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:15,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-19 09:25:15,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:16,968 INFO L124 PetriNetUnfolderBase]: 5641/9212 cut-off events. [2024-11-19 09:25:16,969 INFO L125 PetriNetUnfolderBase]: For 5510/6121 co-relation queries the response was YES. [2024-11-19 09:25:17,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22454 conditions, 9212 events. 5641/9212 cut-off events. For 5510/6121 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 61068 event pairs, 1225 based on Foata normal form. 257/9061 useless extension candidates. Maximal degree in co-relation 22440. Up to 4014 conditions per place. [2024-11-19 09:25:17,031 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 91 selfloop transitions, 36 changer transitions 29/184 dead transitions. [2024-11-19 09:25:17,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 184 transitions, 868 flow [2024-11-19 09:25:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:25:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:25:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 494 transitions. [2024-11-19 09:25:17,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5613636363636364 [2024-11-19 09:25:17,034 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 247 flow. Second operand 16 states and 494 transitions. [2024-11-19 09:25:17,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 184 transitions, 868 flow [2024-11-19 09:25:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 184 transitions, 821 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-11-19 09:25:17,061 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 436 flow [2024-11-19 09:25:17,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=436, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-11-19 09:25:17,062 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2024-11-19 09:25:17,062 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 436 flow [2024-11-19 09:25:17,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:17,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:17,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:17,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:25:17,062 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:17,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1091302579, now seen corresponding path program 2 times [2024-11-19 09:25:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:17,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046920242] [2024-11-19 09:25:17,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:25:17,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:17,083 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:25:17,083 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:17,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:17,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046920242] [2024-11-19 09:25:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046920242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:17,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:17,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:17,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743213369] [2024-11-19 09:25:17,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:17,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:17,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:17,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-19 09:25:17,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 95 transitions, 436 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) [2024-11-19 09:25:17,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:17,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-19 09:25:17,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:18,327 INFO L124 PetriNetUnfolderBase]: 7720/12681 cut-off events. [2024-11-19 09:25:18,327 INFO L125 PetriNetUnfolderBase]: For 13282/13710 co-relation queries the response was YES. [2024-11-19 09:25:18,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35390 conditions, 12681 events. 7720/12681 cut-off events. For 13282/13710 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 88733 event pairs, 2643 based on Foata normal form. 315/12353 useless extension candidates. Maximal degree in co-relation 35370. Up to 7219 conditions per place. [2024-11-19 09:25:18,412 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 105 selfloop transitions, 31 changer transitions 27/195 dead transitions. [2024-11-19 09:25:18,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 195 transitions, 1181 flow [2024-11-19 09:25:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:25:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:25:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 299 transitions. [2024-11-19 09:25:18,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.604040404040404 [2024-11-19 09:25:18,414 INFO L175 Difference]: Start difference. First operand has 84 places, 95 transitions, 436 flow. Second operand 9 states and 299 transitions. [2024-11-19 09:25:18,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 195 transitions, 1181 flow [2024-11-19 09:25:18,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 195 transitions, 1165 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-19 09:25:18,462 INFO L231 Difference]: Finished difference. Result has 92 places, 116 transitions, 699 flow [2024-11-19 09:25:18,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=699, PETRI_PLACES=92, PETRI_TRANSITIONS=116} [2024-11-19 09:25:18,463 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2024-11-19 09:25:18,463 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 116 transitions, 699 flow [2024-11-19 09:25:18,463 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) [2024-11-19 09:25:18,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:18,463 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:18,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:25:18,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:18,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1820846535, now seen corresponding path program 3 times [2024-11-19 09:25:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685257409] [2024-11-19 09:25:18,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:25:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:18,477 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:25:18,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:18,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685257409] [2024-11-19 09:25:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685257409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:25:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944206968] [2024-11-19 09:25:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:25:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:25:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:25:18,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2024-11-19 09:25:18,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 116 transitions, 699 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:18,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:18,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2024-11-19 09:25:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:20,210 INFO L124 PetriNetUnfolderBase]: 10023/16441 cut-off events. [2024-11-19 09:25:20,210 INFO L125 PetriNetUnfolderBase]: For 35582/36243 co-relation queries the response was YES. [2024-11-19 09:25:20,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51111 conditions, 16441 events. 10023/16441 cut-off events. For 35582/36243 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 121653 event pairs, 3184 based on Foata normal form. 349/15832 useless extension candidates. Maximal degree in co-relation 51085. Up to 6776 conditions per place. [2024-11-19 09:25:20,354 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 121 selfloop transitions, 25 changer transitions 18/196 dead transitions. [2024-11-19 09:25:20,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 196 transitions, 1453 flow [2024-11-19 09:25:20,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:25:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:25:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2024-11-19 09:25:20,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-19 09:25:20,357 INFO L175 Difference]: Start difference. First operand has 92 places, 116 transitions, 699 flow. Second operand 8 states and 272 transitions. [2024-11-19 09:25:20,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 196 transitions, 1453 flow [2024-11-19 09:25:20,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 196 transitions, 1435 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-11-19 09:25:20,446 INFO L231 Difference]: Finished difference. Result has 96 places, 116 transitions, 749 flow [2024-11-19 09:25:20,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=749, PETRI_PLACES=96, PETRI_TRANSITIONS=116} [2024-11-19 09:25:20,447 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2024-11-19 09:25:20,447 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 749 flow [2024-11-19 09:25:20,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:20,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:20,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:25:20,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash -708344051, now seen corresponding path program 4 times [2024-11-19 09:25:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699666928] [2024-11-19 09:25:20,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:25:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:20,471 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:25:20,471 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699666928] [2024-11-19 09:25:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699666928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684070839] [2024-11-19 09:25:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:20,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:20,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-19 09:25:20,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 116 transitions, 749 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:20,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:20,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-19 09:25:20,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:22,621 INFO L124 PetriNetUnfolderBase]: 10973/19078 cut-off events. [2024-11-19 09:25:22,622 INFO L125 PetriNetUnfolderBase]: For 33644/35363 co-relation queries the response was YES. [2024-11-19 09:25:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55637 conditions, 19078 events. 10973/19078 cut-off events. For 33644/35363 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 159043 event pairs, 4418 based on Foata normal form. 439/18130 useless extension candidates. Maximal degree in co-relation 55608. Up to 7333 conditions per place. [2024-11-19 09:25:22,720 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 44/164 dead transitions. [2024-11-19 09:25:22,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 164 transitions, 1177 flow [2024-11-19 09:25:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-11-19 09:25:22,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2024-11-19 09:25:22,722 INFO L175 Difference]: Start difference. First operand has 96 places, 116 transitions, 749 flow. Second operand 6 states and 215 transitions. [2024-11-19 09:25:22,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 164 transitions, 1177 flow [2024-11-19 09:25:22,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 164 transitions, 1147 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:22,833 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 601 flow [2024-11-19 09:25:22,833 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=601, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-11-19 09:25:22,834 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2024-11-19 09:25:22,835 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 601 flow [2024-11-19 09:25:22,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:22,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:22,836 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:22,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:25:22,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:22,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1936390377, now seen corresponding path program 5 times [2024-11-19 09:25:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715936100] [2024-11-19 09:25:22,837 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:25:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:22,870 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:25:22,871 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715936100] [2024-11-19 09:25:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715936100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:23,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:23,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450000131] [2024-11-19 09:25:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:23,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:25:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:25:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:25:23,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:23,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 601 flow. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:23,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:23,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:23,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:23,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:23,995 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-19 09:25:23,995 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:25:23,995 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:25:23,995 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:25:24,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,083 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,088 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,088 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,088 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,088 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,095 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,095 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,095 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,095 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:25:24,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,097 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,097 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,097 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,097 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,314 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,314 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,324 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,325 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,325 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,325 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,328 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,328 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,328 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,328 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,330 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,330 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,330 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,330 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,334 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,334 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,334 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,334 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:25:24,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,341 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,342 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,342 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,342 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,342 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,429 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,429 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,429 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,430 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,430 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,431 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,431 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,431 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,431 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][114], [18#L806true, 20#L783true, Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 255#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,439 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,439 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,443 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,443 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,443 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,443 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,444 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,444 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,444 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,444 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,459 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,460 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,460 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,460 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,462 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,462 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,462 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,463 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,464 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,464 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,464 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,464 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,538 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,538 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,538 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,538 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:25:24,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,542 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,542 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,542 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,542 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,543 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,543 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,543 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,543 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,544 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,544 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,544 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,544 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,545 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,545 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,545 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,546 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,555 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,555 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,557 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,557 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,557 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,558 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,558 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,558 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,559 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,559 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,563 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,564 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,564 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,564 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, 5#L878-4true, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,569 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,569 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,569 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,569 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,571 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,571 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,571 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,571 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,632 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,633 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,633 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,633 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,635 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,635 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,635 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,635 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,639 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,639 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,639 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,639 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:25:24,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 29#L811true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,641 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,641 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,641 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,641 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,642 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,642 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,642 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,642 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,643 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,643 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,643 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,643 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,649 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,649 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,649 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,649 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 63#true, Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 5#L878-4true, 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,653 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,653 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,653 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,653 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1))]) [2024-11-19 09:25:24,654 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,664 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,664 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,664 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,664 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,665 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,665 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,665 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,665 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,706 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 5#L878-4true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,709 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,710 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,711 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,711 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,711 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,711 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,712 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,713 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,713 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,713 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:25:24,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 29#L811true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,716 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,716 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,716 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,716 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,720 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,720 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,720 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,720 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,721 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,721 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,721 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,721 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 46#L765true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,733 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,733 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,733 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,733 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 59#L857true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,761 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 131#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, 16#L879true, Black: 93#(= ~__unbuffered_p1_EAX~0 0), Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,762 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,762 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,762 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,762 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, 46#L765true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), 57#P2EXITtrue, Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,765 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,765 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:25:24,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, 67#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, 57#P2EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 184#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,770 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,770 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,770 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,770 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L780-->L783: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][142], [20#L783true, 247#(< (mod ~main$tmp_guard0~0 256) 1), Black: 189#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 63#true, Black: 194#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 192#(and (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 137#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 65#true, 61#true, Black: 77#(= ~__unbuffered_p3_EAX~0 0), 67#true, Black: 216#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 26#P0EXITtrue, Black: 93#(= ~__unbuffered_p1_EAX~0 0), 36#L881true, Black: 235#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 237#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (<= 1 ~x~0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 10#P3EXITtrue, Black: 232#(and (<= 1 ~__unbuffered_p0_EAX~0) (<= 1 ~x~0)), Black: 161#(and (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 57#P2EXITtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 164#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 157#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (not (= ~x~0 0)) (= ~z~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (= ~z$w_buff0~0 1)), 227#(<= 1 ~x~0), Black: 166#(and (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (not (= ~x~0 0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1))) (not (= (mod ~main$tmp_guard1~0 256) 0))), 74#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 151#(and (not (= ~x~0 0)) (= ~z~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= ~__unbuffered_p1_EAX~0 1)))), 207#(= ~a~0 1), Black: 123#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 184#(= ~a~0 1), 144#(not (= ~x~0 0))]) [2024-11-19 09:25:24,800 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,800 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,800 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,800 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:25:24,884 INFO L124 PetriNetUnfolderBase]: 12850/19178 cut-off events. [2024-11-19 09:25:24,885 INFO L125 PetriNetUnfolderBase]: For 28910/31531 co-relation queries the response was YES. [2024-11-19 09:25:24,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57268 conditions, 19178 events. 12850/19178 cut-off events. For 28910/31531 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 132386 event pairs, 560 based on Foata normal form. 1135/19763 useless extension candidates. Maximal degree in co-relation 57239. Up to 6480 conditions per place. [2024-11-19 09:25:24,981 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 57 selfloop transitions, 18 changer transitions 76/169 dead transitions. [2024-11-19 09:25:24,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 169 transitions, 1147 flow [2024-11-19 09:25:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:25:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:25:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2024-11-19 09:25:24,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.638961038961039 [2024-11-19 09:25:24,983 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 601 flow. Second operand 7 states and 246 transitions. [2024-11-19 09:25:24,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 169 transitions, 1147 flow [2024-11-19 09:25:25,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 169 transitions, 1071 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-19 09:25:25,166 INFO L231 Difference]: Finished difference. Result has 98 places, 61 transitions, 345 flow [2024-11-19 09:25:25,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=98, PETRI_TRANSITIONS=61} [2024-11-19 09:25:25,166 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 36 predicate places. [2024-11-19 09:25:25,166 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 345 flow [2024-11-19 09:25:25,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:25,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:25,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:25,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:25:25,167 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:25,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2143477423, now seen corresponding path program 1 times [2024-11-19 09:25:25,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:25,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726138783] [2024-11-19 09:25:25,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726138783] [2024-11-19 09:25:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726138783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:25,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79202246] [2024-11-19 09:25:25,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:25,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:25,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:25,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:25,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:25,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 55 [2024-11-19 09:25:25,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 61 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:25,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:25,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 55 [2024-11-19 09:25:25,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:25,919 INFO L124 PetriNetUnfolderBase]: 2105/3957 cut-off events. [2024-11-19 09:25:25,919 INFO L125 PetriNetUnfolderBase]: For 7687/8061 co-relation queries the response was YES. [2024-11-19 09:25:25,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11873 conditions, 3957 events. 2105/3957 cut-off events. For 7687/8061 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27972 event pairs, 568 based on Foata normal form. 30/3681 useless extension candidates. Maximal degree in co-relation 11845. Up to 1428 conditions per place. [2024-11-19 09:25:26,103 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 39 selfloop transitions, 2 changer transitions 19/92 dead transitions. [2024-11-19 09:25:26,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 575 flow [2024-11-19 09:25:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2024-11-19 09:25:26,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-19 09:25:26,111 INFO L175 Difference]: Start difference. First operand has 98 places, 61 transitions, 345 flow. Second operand 6 states and 200 transitions. [2024-11-19 09:25:26,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 575 flow [2024-11-19 09:25:26,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 417 flow, removed 48 selfloop flow, removed 18 redundant places. [2024-11-19 09:25:26,142 INFO L231 Difference]: Finished difference. Result has 80 places, 58 transitions, 218 flow [2024-11-19 09:25:26,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=80, PETRI_TRANSITIONS=58} [2024-11-19 09:25:26,143 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 18 predicate places. [2024-11-19 09:25:26,143 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 58 transitions, 218 flow [2024-11-19 09:25:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:26,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:26,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:26,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:25:26,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:26,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1479410719, now seen corresponding path program 2 times [2024-11-19 09:25:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661881371] [2024-11-19 09:25:26,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:25:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:26,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:25:26,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:25:27,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661881371] [2024-11-19 09:25:27,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661881371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:25:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124891961] [2024-11-19 09:25:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:25:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:25:27,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:25:27,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:25:27,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2024-11-19 09:25:27,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 58 transitions, 218 flow. Second operand has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:27,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:27,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2024-11-19 09:25:27,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:27,933 INFO L124 PetriNetUnfolderBase]: 2053/3844 cut-off events. [2024-11-19 09:25:27,933 INFO L125 PetriNetUnfolderBase]: For 726/746 co-relation queries the response was YES. [2024-11-19 09:25:27,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8141 conditions, 3844 events. 2053/3844 cut-off events. For 726/746 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 26959 event pairs, 558 based on Foata normal form. 16/3509 useless extension candidates. Maximal degree in co-relation 8123. Up to 1374 conditions per place. [2024-11-19 09:25:27,950 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 32 selfloop transitions, 7 changer transitions 17/91 dead transitions. [2024-11-19 09:25:27,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 91 transitions, 406 flow [2024-11-19 09:25:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:25:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:25:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 315 transitions. [2024-11-19 09:25:27,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2024-11-19 09:25:27,952 INFO L175 Difference]: Start difference. First operand has 80 places, 58 transitions, 218 flow. Second operand 10 states and 315 transitions. [2024-11-19 09:25:27,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 91 transitions, 406 flow [2024-11-19 09:25:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 91 transitions, 395 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-19 09:25:27,955 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 246 flow [2024-11-19 09:25:27,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2024-11-19 09:25:27,956 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 25 predicate places. [2024-11-19 09:25:27,956 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 246 flow [2024-11-19 09:25:27,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.0) internal successors, (252), 9 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:27,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:27,956 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:27,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:25:27,956 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:27,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1877064649, now seen corresponding path program 3 times [2024-11-19 09:25:27,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:25:27,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144465234] [2024-11-19 09:25:27,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:25:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:25:28,002 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:25:28,002 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:25:28,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:25:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:25:28,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:25:28,087 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:25:28,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-19 09:25:28,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-19 09:25:28,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-19 09:25:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-19 09:25:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-19 09:25:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-19 09:25:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-19 09:25:28,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-19 09:25:28,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:25:28,092 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:28,159 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:25:28,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:25:28,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:25:28 BasicIcfg [2024-11-19 09:25:28,163 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:25:28,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:25:28,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:25:28,163 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:25:28,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:25:10" (3/4) ... [2024-11-19 09:25:28,165 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:25:28,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:25:28,168 INFO L158 Benchmark]: Toolchain (without parser) took 18918.67ms. Allocated memory was 176.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 140.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 930.7MB. Max. memory is 16.1GB. [2024-11-19 09:25:28,168 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:25:28,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.26ms. Allocated memory is still 176.2MB. Free memory was 140.4MB in the beginning and 113.4MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 09:25:28,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.93ms. Allocated memory is still 176.2MB. Free memory was 113.4MB in the beginning and 109.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:25:28,169 INFO L158 Benchmark]: Boogie Preprocessor took 66.77ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:25:28,169 INFO L158 Benchmark]: RCFGBuilder took 666.19ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 139.8MB in the end (delta: -34.0MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2024-11-19 09:25:28,169 INFO L158 Benchmark]: TraceAbstraction took 17662.23ms. Allocated memory was 176.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 139.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 928.3MB. Max. memory is 16.1GB. [2024-11-19 09:25:28,170 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 3.0GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:25:28,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.26ms. Allocated memory is still 176.2MB. Free memory was 140.4MB in the beginning and 113.4MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.93ms. Allocated memory is still 176.2MB. Free memory was 113.4MB in the beginning and 109.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.77ms. Allocated memory is still 176.2MB. Free memory was 109.9MB in the beginning and 105.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 666.19ms. Allocated memory is still 176.2MB. Free memory was 105.7MB in the beginning and 139.8MB in the end (delta: -34.0MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17662.23ms. Allocated memory was 176.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 139.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 928.3MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 3.0GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible 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_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, t326=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-4, t326=-3, t327=-2, t328=-1, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix013.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 870 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2252 IncrementalHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 49 mSDtfsCounter, 2252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=10, InterpolantAutomatonStates: 98, 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.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:25:28,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:25:30,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:25:30,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:25:30,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:25:30,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:25:30,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:25:30,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:25:30,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:25:30,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:25:30,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:25:30,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:25:30,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:25:30,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:25:30,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:25:30,427 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:25:30,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:25:30,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:25:30,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:25:30,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:25:30,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:25:30,430 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:25:30,430 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:25:30,431 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:25:30,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:25:30,431 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:25:30,431 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:25:30,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:25:30,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:25:30,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:25:30,432 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:25:30,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:25:30,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:25:30,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:25:30,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:25:30,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:25:30,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:25:30,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:25:30,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:25:30,434 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:25:30,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:25:30,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:25:30,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:25:30,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:25:30,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:25:30,437 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2024-11-19 09:25:30,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:25:30,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:25:30,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:25:30,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:25:30,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:25:30,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2024-11-19 09:25:32,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:25:32,334 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:25:32,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2024-11-19 09:25:32,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66163db34/a131575553a54c71925296acdf8ccd04/FLAG69fba0161 [2024-11-19 09:25:32,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66163db34/a131575553a54c71925296acdf8ccd04 [2024-11-19 09:25:32,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:25:32,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:25:32,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:25:32,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:25:32,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:25:32,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b55010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32, skipping insertion in model container [2024-11-19 09:25:32,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:25:32,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:25:32,792 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:25:32,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:25:32,892 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:25:32,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32 WrapperNode [2024-11-19 09:25:32,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:25:32,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:25:32,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:25:32,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:25:32,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,949 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2024-11-19 09:25:32,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:25:32,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:25:32,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:25:32,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:25:32,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,985 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 09:25:32,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:32,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:33,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:33,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:33,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:33,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:25:33,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:25:33,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:25:33,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:25:33,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (1/1) ... [2024-11-19 09:25:33,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:25:33,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:25:33,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:25:33,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:25:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:25:33,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:25:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:25:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:25:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-19 09:25:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:25:33,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:25:33,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:25:33,082 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:25:33,198 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:25:33,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:25:33,539 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:25:33,539 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:25:33,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:25:33,730 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:25:33,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:25:33 BoogieIcfgContainer [2024-11-19 09:25:33,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:25:33,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:25:33,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:25:33,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:25:33,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:25:32" (1/3) ... [2024-11-19 09:25:33,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d1bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:25:33, skipping insertion in model container [2024-11-19 09:25:33,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:25:32" (2/3) ... [2024-11-19 09:25:33,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d1bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:25:33, skipping insertion in model container [2024-11-19 09:25:33,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:25:33" (3/3) ... [2024-11-19 09:25:33,739 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2024-11-19 09:25:33,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:25:33,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 09:25:33,753 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:25:33,802 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:25:33,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 126 flow [2024-11-19 09:25:33,865 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2024-11-19 09:25:33,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:33,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 109 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-11-19 09:25:33,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 55 transitions, 126 flow [2024-11-19 09:25:33,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 51 transitions, 114 flow [2024-11-19 09:25:33,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:25:33,887 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fd2fb47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:25:33,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-19 09:25:33,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:25:33,897 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-19 09:25:33,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:33,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:33,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:33,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:33,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash 12604335, now seen corresponding path program 1 times [2024-11-19 09:25:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781782781] [2024-11-19 09:25:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:33,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:33,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:33,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:33,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:25:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:34,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:25:34,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:34,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:34,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781782781] [2024-11-19 09:25:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781782781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:25:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93672477] [2024-11-19 09:25:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:25:34,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:25:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:25:34,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2024-11-19 09:25:34,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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) [2024-11-19 09:25:34,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:34,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2024-11-19 09:25:34,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:34,487 INFO L124 PetriNetUnfolderBase]: 1175/1905 cut-off events. [2024-11-19 09:25:34,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:34,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1905 events. 1175/1905 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12218 event pairs, 343 based on Foata normal form. 120/1994 useless extension candidates. Maximal degree in co-relation 3629. Up to 1361 conditions per place. [2024-11-19 09:25:34,504 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 30 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2024-11-19 09:25:34,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 196 flow [2024-11-19 09:25:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:25:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:25:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-11-19 09:25:34,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2024-11-19 09:25:34,516 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 123 transitions. [2024-11-19 09:25:34,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 196 flow [2024-11-19 09:25:34,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:34,523 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2024-11-19 09:25:34,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-19 09:25:34,528 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-11-19 09:25:34,528 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2024-11-19 09:25:34,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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) [2024-11-19 09:25:34,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:34,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:34,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:25:34,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:34,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:34,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash 147367257, now seen corresponding path program 1 times [2024-11-19 09:25:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080400735] [2024-11-19 09:25:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:34,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:34,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:34,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:25:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:34,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:25:34,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:34,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:34,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080400735] [2024-11-19 09:25:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080400735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:25:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223370972] [2024-11-19 09:25:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:34,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:25:34,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:34,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:25:34,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:25:34,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:34,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:34,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:34,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:34,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:35,707 INFO L124 PetriNetUnfolderBase]: 5233/8286 cut-off events. [2024-11-19 09:25:35,709 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-11-19 09:25:35,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15926 conditions, 8286 events. 5233/8286 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 59712 event pairs, 603 based on Foata normal form. 216/8490 useless extension candidates. Maximal degree in co-relation 15916. Up to 4837 conditions per place. [2024-11-19 09:25:35,757 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 48 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-11-19 09:25:35,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 280 flow [2024-11-19 09:25:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:25:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:25:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2024-11-19 09:25:35,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6772727272727272 [2024-11-19 09:25:35,760 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 4 states and 149 transitions. [2024-11-19 09:25:35,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 280 flow [2024-11-19 09:25:35,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:25:35,762 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 142 flow [2024-11-19 09:25:35,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-19 09:25:35,763 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2024-11-19 09:25:35,763 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 142 flow [2024-11-19 09:25:35,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:35,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:35,763 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:35,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:25:35,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:35,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 990553994, now seen corresponding path program 1 times [2024-11-19 09:25:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283723448] [2024-11-19 09:25:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:35,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:35,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:35,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:35,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:25:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:36,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:25:36,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:36,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:36,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283723448] [2024-11-19 09:25:36,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283723448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:36,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:25:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844064878] [2024-11-19 09:25:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:25:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:25:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:25:36,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:36,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:36,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:36,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:36,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:36,872 INFO L124 PetriNetUnfolderBase]: 4321/6880 cut-off events. [2024-11-19 09:25:36,872 INFO L125 PetriNetUnfolderBase]: For 1725/1733 co-relation queries the response was YES. [2024-11-19 09:25:36,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15358 conditions, 6880 events. 4321/6880 cut-off events. For 1725/1733 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 48072 event pairs, 213 based on Foata normal form. 210/7078 useless extension candidates. Maximal degree in co-relation 15346. Up to 3649 conditions per place. [2024-11-19 09:25:36,912 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 61 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2024-11-19 09:25:36,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 397 flow [2024-11-19 09:25:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:25:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:25:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-11-19 09:25:36,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6872727272727273 [2024-11-19 09:25:36,914 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 142 flow. Second operand 5 states and 189 transitions. [2024-11-19 09:25:36,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 397 flow [2024-11-19 09:25:36,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 386 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:25:36,918 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 194 flow [2024-11-19 09:25:36,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-11-19 09:25:36,918 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2024-11-19 09:25:36,918 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 194 flow [2024-11-19 09:25:36,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:36,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:36,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:36,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:25:37,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:37,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:37,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:37,121 INFO L85 PathProgramCache]: Analyzing trace with hash -915238590, now seen corresponding path program 1 times [2024-11-19 09:25:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:37,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533672566] [2024-11-19 09:25:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:37,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:37,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:37,125 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:37,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:25:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:37,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:25:37,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:37,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:37,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:37,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533672566] [2024-11-19 09:25:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533672566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:25:37,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092285119] [2024-11-19 09:25:37,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:37,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:37,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:37,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:37,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:37,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:37,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:37,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:37,780 INFO L124 PetriNetUnfolderBase]: 2739/4330 cut-off events. [2024-11-19 09:25:37,781 INFO L125 PetriNetUnfolderBase]: For 3200/3216 co-relation queries the response was YES. [2024-11-19 09:25:37,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10920 conditions, 4330 events. 2739/4330 cut-off events. For 3200/3216 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 26001 event pairs, 81 based on Foata normal form. 168/4486 useless extension candidates. Maximal degree in co-relation 10906. Up to 1633 conditions per place. [2024-11-19 09:25:37,801 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 72 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2024-11-19 09:25:37,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 106 transitions, 520 flow [2024-11-19 09:25:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 227 transitions. [2024-11-19 09:25:37,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6878787878787879 [2024-11-19 09:25:37,804 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 194 flow. Second operand 6 states and 227 transitions. [2024-11-19 09:25:37,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 106 transitions, 520 flow [2024-11-19 09:25:37,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 490 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:37,811 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 244 flow [2024-11-19 09:25:37,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2024-11-19 09:25:37,812 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2024-11-19 09:25:37,812 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 244 flow [2024-11-19 09:25:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:37,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:37,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:37,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:25:38,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:38,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1453261669, now seen corresponding path program 1 times [2024-11-19 09:25:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:38,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798978909] [2024-11-19 09:25:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:38,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:38,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:38,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:25:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:38,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:25:38,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:38,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:38,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:38,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798978909] [2024-11-19 09:25:38,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798978909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:38,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999028902] [2024-11-19 09:25:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:25:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:25:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:25:38,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 55 [2024-11-19 09:25:38,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:38,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:38,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 55 [2024-11-19 09:25:38,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:38,547 INFO L124 PetriNetUnfolderBase]: 1591/2394 cut-off events. [2024-11-19 09:25:38,548 INFO L125 PetriNetUnfolderBase]: For 3374/3390 co-relation queries the response was YES. [2024-11-19 09:25:38,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 2394 events. 1591/2394 cut-off events. For 3374/3390 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11755 event pairs, 47 based on Foata normal form. 84/2466 useless extension candidates. Maximal degree in co-relation 6962. Up to 768 conditions per place. [2024-11-19 09:25:38,562 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 65 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2024-11-19 09:25:38,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 103 transitions, 518 flow [2024-11-19 09:25:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:25:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:25:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-11-19 09:25:38,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6415584415584416 [2024-11-19 09:25:38,566 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 244 flow. Second operand 7 states and 247 transitions. [2024-11-19 09:25:38,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 103 transitions, 518 flow [2024-11-19 09:25:38,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 472 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-19 09:25:38,576 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 254 flow [2024-11-19 09:25:38,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2024-11-19 09:25:38,576 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2024-11-19 09:25:38,577 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 254 flow [2024-11-19 09:25:38,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:38,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:38,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:38,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:25:38,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:38,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:38,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash -110047941, now seen corresponding path program 1 times [2024-11-19 09:25:38,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:38,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095652735] [2024-11-19 09:25:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:38,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:38,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:38,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:25:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:38,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:25:38,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:38,929 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:38,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095652735] [2024-11-19 09:25:38,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095652735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:25:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213840467] [2024-11-19 09:25:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:38,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:25:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:25:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:25:38,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-19 09:25:38,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:38,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:38,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-19 09:25:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:39,038 INFO L124 PetriNetUnfolderBase]: 702/1300 cut-off events. [2024-11-19 09:25:39,039 INFO L125 PetriNetUnfolderBase]: For 702/738 co-relation queries the response was YES. [2024-11-19 09:25:39,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 1300 events. 702/1300 cut-off events. For 702/738 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7548 event pairs, 631 based on Foata normal form. 16/1200 useless extension candidates. Maximal degree in co-relation 2974. Up to 988 conditions per place. [2024-11-19 09:25:39,046 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 20 selfloop transitions, 1 changer transitions 1/57 dead transitions. [2024-11-19 09:25:39,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 57 transitions, 296 flow [2024-11-19 09:25:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:25:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:25:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-11-19 09:25:39,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-11-19 09:25:39,048 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 254 flow. Second operand 3 states and 104 transitions. [2024-11-19 09:25:39,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 57 transitions, 296 flow [2024-11-19 09:25:39,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 57 transitions, 200 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-19 09:25:39,052 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 156 flow [2024-11-19 09:25:39,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2024-11-19 09:25:39,053 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-11-19 09:25:39,054 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 156 flow [2024-11-19 09:25:39,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:39,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:39,054 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:39,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:25:39,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:39,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash -750446547, now seen corresponding path program 1 times [2024-11-19 09:25:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890852713] [2024-11-19 09:25:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:25:39,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:39,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:39,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:39,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:25:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:25:39,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:25:39,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:39,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:39,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890852713] [2024-11-19 09:25:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890852713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198972744] [2024-11-19 09:25:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:39,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:39,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:39,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:39,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-19 09:25:39,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:39,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:39,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-19 09:25:39,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:39,717 INFO L124 PetriNetUnfolderBase]: 1963/3440 cut-off events. [2024-11-19 09:25:39,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:25:39,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6705 conditions, 3440 events. 1963/3440 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22469 event pairs, 307 based on Foata normal form. 16/3265 useless extension candidates. Maximal degree in co-relation 6698. Up to 1267 conditions per place. [2024-11-19 09:25:39,734 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 43 selfloop transitions, 2 changer transitions 12/89 dead transitions. [2024-11-19 09:25:39,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 340 flow [2024-11-19 09:25:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-11-19 09:25:39,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-11-19 09:25:39,736 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 156 flow. Second operand 6 states and 208 transitions. [2024-11-19 09:25:39,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 340 flow [2024-11-19 09:25:39,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:25:39,738 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 172 flow [2024-11-19 09:25:39,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-19 09:25:39,738 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2024-11-19 09:25:39,739 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 172 flow [2024-11-19 09:25:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:39,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:39,739 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:39,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:25:39,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:39,940 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -553049741, now seen corresponding path program 2 times [2024-11-19 09:25:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042792731] [2024-11-19 09:25:39,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:25:39,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:39,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:39,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:25:40,025 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:25:40,025 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:40,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:25:40,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:40,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:40,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042792731] [2024-11-19 09:25:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042792731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:40,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:40,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575176414] [2024-11-19 09:25:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:40,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:40,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:40,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-19 09:25:40,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:40,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:40,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-19 09:25:40,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:40,629 INFO L124 PetriNetUnfolderBase]: 3735/6656 cut-off events. [2024-11-19 09:25:40,629 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-19 09:25:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13071 conditions, 6656 events. 3735/6656 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 49444 event pairs, 1051 based on Foata normal form. 16/6223 useless extension candidates. Maximal degree in co-relation 13060. Up to 2320 conditions per place. [2024-11-19 09:25:40,653 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 35 selfloop transitions, 1 changer transitions 26/95 dead transitions. [2024-11-19 09:25:40,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 384 flow [2024-11-19 09:25:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-11-19 09:25:40,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2024-11-19 09:25:40,654 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 172 flow. Second operand 6 states and 213 transitions. [2024-11-19 09:25:40,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 384 flow [2024-11-19 09:25:40,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 377 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-19 09:25:40,657 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 178 flow [2024-11-19 09:25:40,657 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2024-11-19 09:25:40,657 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2024-11-19 09:25:40,658 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 178 flow [2024-11-19 09:25:40,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:40,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:40,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:40,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:25:40,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:40,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 285119649, now seen corresponding path program 3 times [2024-11-19 09:25:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:40,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096136424] [2024-11-19 09:25:40,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:25:40,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:40,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:40,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:40,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:25:40,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:25:40,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:40,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:25:40,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:41,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:41,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:41,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096136424] [2024-11-19 09:25:41,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096136424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:41,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:41,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:25:41,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715396758] [2024-11-19 09:25:41,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:41,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:25:41,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:25:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:25:41,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 55 [2024-11-19 09:25:41,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:41,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:41,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 55 [2024-11-19 09:25:41,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:41,546 INFO L124 PetriNetUnfolderBase]: 3281/5766 cut-off events. [2024-11-19 09:25:41,546 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-11-19 09:25:41,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11523 conditions, 5766 events. 3281/5766 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 42693 event pairs, 939 based on Foata normal form. 16/5200 useless extension candidates. Maximal degree in co-relation 11510. Up to 2524 conditions per place. [2024-11-19 09:25:41,567 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 27 selfloop transitions, 1 changer transitions 30/91 dead transitions. [2024-11-19 09:25:41,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 374 flow [2024-11-19 09:25:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:25:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:25:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2024-11-19 09:25:41,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-11-19 09:25:41,569 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 178 flow. Second operand 6 states and 209 transitions. [2024-11-19 09:25:41,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 374 flow [2024-11-19 09:25:41,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 363 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:41,573 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 182 flow [2024-11-19 09:25:41,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=182, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2024-11-19 09:25:41,573 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2024-11-19 09:25:41,574 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 182 flow [2024-11-19 09:25:41,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:41,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:41,574 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:41,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:25:41,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:41,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1889752851, now seen corresponding path program 4 times [2024-11-19 09:25:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345807443] [2024-11-19 09:25:41,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:25:41,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:41,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:41,777 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:41,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:25:41,853 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:25:41,854 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:25:41,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:25:41,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:25:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:25:42,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:25:42,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:25:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345807443] [2024-11-19 09:25:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345807443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:25:42,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:25:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:25:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135432113] [2024-11-19 09:25:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:25:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:25:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:25:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:25:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:25:42,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2024-11-19 09:25:42,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 182 flow. Second operand has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:42,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:25:42,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2024-11-19 09:25:42,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:25:43,000 INFO L124 PetriNetUnfolderBase]: 2441/4404 cut-off events. [2024-11-19 09:25:43,001 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-19 09:25:43,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8761 conditions, 4404 events. 2441/4404 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 31604 event pairs, 531 based on Foata normal form. 16/4002 useless extension candidates. Maximal degree in co-relation 8747. Up to 1014 conditions per place. [2024-11-19 09:25:43,022 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 38 selfloop transitions, 5 changer transitions 12/90 dead transitions. [2024-11-19 09:25:43,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 364 flow [2024-11-19 09:25:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:25:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:25:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 272 transitions. [2024-11-19 09:25:43,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-19 09:25:43,024 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 182 flow. Second operand 8 states and 272 transitions. [2024-11-19 09:25:43,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 364 flow [2024-11-19 09:25:43,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 353 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:25:43,026 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 209 flow [2024-11-19 09:25:43,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2024-11-19 09:25:43,027 INFO L277 CegarLoopForPetriNet]: 62 programPoint places, 17 predicate places. [2024-11-19 09:25:43,027 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 209 flow [2024-11-19 09:25:43,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.25) internal successors, (234), 8 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:25:43,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:25:43,027 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:43,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:25:43,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:43,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-19 09:25:43,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:25:43,230 INFO L85 PathProgramCache]: Analyzing trace with hash 660338391, now seen corresponding path program 5 times [2024-11-19 09:25:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:25:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182787551] [2024-11-19 09:25:43,231 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:25:43,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:43,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:25:43,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:25:43,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:25:43,305 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:25:43,306 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:25:43,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:25:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:25:43,409 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:25:43,409 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:25:43,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-19 09:25:43,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-19 09:25:43,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-19 09:25:43,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-19 09:25:43,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-19 09:25:43,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-19 09:25:43,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-19 09:25:43,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-19 09:25:43,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 09:25:43,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:25:43,614 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2024-11-19 09:25:43,692 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:25:43,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:25:43,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:25:43 BasicIcfg [2024-11-19 09:25:43,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:25:43,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:25:43,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:25:43,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:25:43,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:25:33" (3/4) ... [2024-11-19 09:25:43,698 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:25:43,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:25:43,700 INFO L158 Benchmark]: Toolchain (without parser) took 11326.12ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 39.5MB in the beginning and 424.9MB in the end (delta: -385.4MB). Peak memory consumption was 666.2MB. Max. memory is 16.1GB. [2024-11-19 09:25:43,700 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:25:43,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.12ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 29.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-19 09:25:43,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.49ms. Allocated memory is still 71.3MB. Free memory was 29.3MB in the beginning and 47.5MB in the end (delta: -18.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:25:43,700 INFO L158 Benchmark]: Boogie Preprocessor took 54.24ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 43.6MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:25:43,701 INFO L158 Benchmark]: RCFGBuilder took 720.37ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 43.6MB in the beginning and 48.0MB in the end (delta: -4.4MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-19 09:25:43,701 INFO L158 Benchmark]: TraceAbstraction took 9963.34ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 47.5MB in the beginning and 424.9MB in the end (delta: -377.5MB). Peak memory consumption was 659.6MB. Max. memory is 16.1GB. [2024-11-19 09:25:43,701 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 1.1GB. Free memory is still 424.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:25:43,702 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.18ms. Allocated memory is still 54.5MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.12ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 29.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.49ms. Allocated memory is still 71.3MB. Free memory was 29.3MB in the beginning and 47.5MB in the end (delta: -18.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.24ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 43.6MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 720.37ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 43.6MB in the beginning and 48.0MB in the end (delta: -4.4MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9963.34ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 47.5MB in the beginning and 424.9MB in the end (delta: -377.5MB). Peak memory consumption was 659.6MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 1.1GB. Free memory is still 424.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible 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_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, t327=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-1, t326=0, t327=1, t328=2, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix013.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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. - 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1678 IncrementalHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 6 mSDtfsCounter, 1678 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=5, InterpolantAutomatonStates: 54, 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.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 343 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1291 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:25:43,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample