/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:33:14,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:33:14,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:33:14,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:33:14,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:33:14,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:33:14,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:33:14,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:33:14,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:33:14,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:33:14,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:33:14,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:33:14,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:33:14,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:33:14,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:33:14,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:33:14,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:33:14,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:33:14,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:33:14,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:33:14,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:33:14,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:33:14,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:33:15,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:33:15,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:33:15,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:33:15,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:33:15,121 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:33:15,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2025-04-13 19:33:16,432 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff434a45b/bce543ebc0634b64a524e165f9609503/FLAGfeaf23e45 [2025-04-13 19:33:16,663 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:33:16,663 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i [2025-04-13 19:33:16,677 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff434a45b/bce543ebc0634b64a524e165f9609503/FLAGfeaf23e45 [2025-04-13 19:33:17,483 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff434a45b/bce543ebc0634b64a524e165f9609503 [2025-04-13 19:33:17,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:33:17,486 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:33:17,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:33:17,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:33:17,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:33:17,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1559b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17, skipping insertion in model container [2025-04-13 19:33:17,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:33:17,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i[944,957] [2025-04-13 19:33:17,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:33:17,803 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:33:17,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.opt.i[944,957] [2025-04-13 19:33:17,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:33:17,887 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:33:17,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17 WrapperNode [2025-04-13 19:33:17,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:33:17,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:33:17,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:33:17,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:33:17,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,922 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2025-04-13 19:33:17,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:33:17,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:33:17,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:33:17,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:33:17,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,955 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:33:17,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:33:17,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:33:17,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:33:17,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:33:17,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (1/1) ... [2025-04-13 19:33:17,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:33:17,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:33:17,995 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) [2025-04-13 19:33:17,998 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 [2025-04-13 19:33:18,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:33:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:33:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:33:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:33:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:33:18,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:33:18,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:33:18,017 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:33:18,136 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:33:18,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:33:18,380 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:33:18,381 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:33:18,381 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:33:18,594 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:33:18,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:33:18 BoogieIcfgContainer [2025-04-13 19:33:18,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:33:18,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:33:18,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:33:18,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:33:18,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:33:17" (1/3) ... [2025-04-13 19:33:18,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9a7a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:33:18, skipping insertion in model container [2025-04-13 19:33:18,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:33:17" (2/3) ... [2025-04-13 19:33:18,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9a7a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:33:18, skipping insertion in model container [2025-04-13 19:33:18,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:33:18" (3/3) ... [2025-04-13 19:33:18,602 INFO L128 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2025-04-13 19:33:18,612 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:33:18,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix039.opt.i that has 5 procedures, 47 locations, 42 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:33:18,613 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:33:18,655 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:33:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:33:18,703 INFO L116 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-04-13 19:33:18,704 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:33:18,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:33:18,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:33:18,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2025-04-13 19:33:18,717 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:33:18,727 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@80ae9a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:33:18,727 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:33:18,736 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:33:18,737 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-13 19:33:18,737 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:33:18,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:18,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:18,738 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:18,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash 59032874, now seen corresponding path program 1 times [2025-04-13 19:33:18,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:18,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627674896] [2025-04-13 19:33:18,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:18,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 19:33:18,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 19:33:18,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:19,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:19,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627674896] [2025-04-13 19:33:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627674896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:33:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668276581] [2025-04-13 19:33:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:19,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:33:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:19,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:33:19,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:33:19,147 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 46 [2025-04-13 19:33:19,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:19,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:19,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 46 [2025-04-13 19:33:19,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:19,450 INFO L116 PetriNetUnfolderBase]: 699/1379 cut-off events. [2025-04-13 19:33:19,450 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:33:19,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1379 events. 699/1379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9941 event pairs, 159 based on Foata normal form. 0/1303 useless extension candidates. Maximal degree in co-relation 2435. Up to 757 conditions per place. [2025-04-13 19:33:19,471 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 25 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2025-04-13 19:33:19,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 170 flow [2025-04-13 19:33:19,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:33:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:33:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-04-13 19:33:19,482 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2025-04-13 19:33:19,484 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 105 transitions. [2025-04-13 19:33:19,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 170 flow [2025-04-13 19:33:19,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:33:19,493 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 92 flow [2025-04-13 19:33:19,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2025-04-13 19:33:19,499 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2025-04-13 19:33:19,499 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 92 flow [2025-04-13 19:33:19,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:19,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:19,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:19,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:33:19,501 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:19,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1210674711, now seen corresponding path program 1 times [2025-04-13 19:33:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:19,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806389931] [2025-04-13 19:33:19,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:33:19,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:33:19,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:19,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:19,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806389931] [2025-04-13 19:33:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806389931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:19,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:33:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615255710] [2025-04-13 19:33:19,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:19,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:33:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:19,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:33:19,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:33:19,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 46 [2025-04-13 19:33:19,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:19,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:19,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 46 [2025-04-13 19:33:19,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:20,006 INFO L116 PetriNetUnfolderBase]: 863/1471 cut-off events. [2025-04-13 19:33:20,006 INFO L117 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-04-13 19:33:20,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1471 events. 863/1471 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10009 event pairs, 283 based on Foata normal form. 60/1491 useless extension candidates. Maximal degree in co-relation 2835. Up to 733 conditions per place. [2025-04-13 19:33:20,015 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 26 selfloop transitions, 2 changer transitions 13/60 dead transitions. [2025-04-13 19:33:20,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 216 flow [2025-04-13 19:33:20,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:33:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:33:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-04-13 19:33:20,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2025-04-13 19:33:20,018 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 5 states and 158 transitions. [2025-04-13 19:33:20,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 216 flow [2025-04-13 19:33:20,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:33:20,021 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 100 flow [2025-04-13 19:33:20,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-04-13 19:33:20,022 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2025-04-13 19:33:20,022 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 100 flow [2025-04-13 19:33:20,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:20,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:20,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:20,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:33:20,023 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:20,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1031916666, now seen corresponding path program 1 times [2025-04-13 19:33:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:20,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505538718] [2025-04-13 19:33:20,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:20,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:33:20,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:33:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:20,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:20,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505538718] [2025-04-13 19:33:20,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505538718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:20,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:20,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:33:20,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472767445] [2025-04-13 19:33:20,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:20,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:33:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:20,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:33:20,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:33:20,243 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2025-04-13 19:33:20,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:20,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:20,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2025-04-13 19:33:20,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:20,588 INFO L116 PetriNetUnfolderBase]: 1491/2501 cut-off events. [2025-04-13 19:33:20,588 INFO L117 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2025-04-13 19:33:20,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 2501 events. 1491/2501 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 17095 event pairs, 547 based on Foata normal form. 72/2529 useless extension candidates. Maximal degree in co-relation 4913. Up to 1869 conditions per place. [2025-04-13 19:33:20,605 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 32 selfloop transitions, 3 changer transitions 14/67 dead transitions. [2025-04-13 19:33:20,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 258 flow [2025-04-13 19:33:20,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:33:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:33:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-04-13 19:33:20,607 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-04-13 19:33:20,607 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 100 flow. Second operand 5 states and 161 transitions. [2025-04-13 19:33:20,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 258 flow [2025-04-13 19:33:20,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 250 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:33:20,612 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 119 flow [2025-04-13 19:33:20,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-04-13 19:33:20,613 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2025-04-13 19:33:20,614 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 119 flow [2025-04-13 19:33:20,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:20,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:20,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:20,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:33:20,614 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:20,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1887956979, now seen corresponding path program 1 times [2025-04-13 19:33:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:20,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998800584] [2025-04-13 19:33:20,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:20,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:33:20,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:33:20,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:20,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:20,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998800584] [2025-04-13 19:33:20,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998800584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:20,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:33:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433238756] [2025-04-13 19:33:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:20,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:33:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:20,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:33:20,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:33:20,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2025-04-13 19:33:20,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:20,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:20,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2025-04-13 19:33:20,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:21,261 INFO L116 PetriNetUnfolderBase]: 4184/6083 cut-off events. [2025-04-13 19:33:21,261 INFO L117 PetriNetUnfolderBase]: For 1030/1030 co-relation queries the response was YES. [2025-04-13 19:33:21,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13085 conditions, 6083 events. 4184/6083 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 39168 event pairs, 688 based on Foata normal form. 225/6156 useless extension candidates. Maximal degree in co-relation 13071. Up to 3236 conditions per place. [2025-04-13 19:33:21,292 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 44 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2025-04-13 19:33:21,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 277 flow [2025-04-13 19:33:21,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:33:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:33:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-04-13 19:33:21,293 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2025-04-13 19:33:21,293 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 119 flow. Second operand 4 states and 132 transitions. [2025-04-13 19:33:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 277 flow [2025-04-13 19:33:21,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 272 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:33:21,304 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 160 flow [2025-04-13 19:33:21,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2025-04-13 19:33:21,305 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2025-04-13 19:33:21,305 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 160 flow [2025-04-13 19:33:21,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:21,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:21,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:21,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:33:21,305 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:21,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -560106322, now seen corresponding path program 1 times [2025-04-13 19:33:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:21,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412338721] [2025-04-13 19:33:21,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:21,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:33:21,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:33:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:21,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:21,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412338721] [2025-04-13 19:33:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412338721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:21,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:33:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321361992] [2025-04-13 19:33:21,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:21,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:33:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:21,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:33:21,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:33:21,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:33:21,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:21,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:21,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:33:21,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:22,603 INFO L116 PetriNetUnfolderBase]: 10015/15810 cut-off events. [2025-04-13 19:33:22,603 INFO L117 PetriNetUnfolderBase]: For 5136/5866 co-relation queries the response was YES. [2025-04-13 19:33:22,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36367 conditions, 15810 events. 10015/15810 cut-off events. For 5136/5866 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 121145 event pairs, 3413 based on Foata normal form. 364/14863 useless extension candidates. Maximal degree in co-relation 36351. Up to 6629 conditions per place. [2025-04-13 19:33:22,705 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 65 selfloop transitions, 10 changer transitions 0/95 dead transitions. [2025-04-13 19:33:22,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 95 transitions, 436 flow [2025-04-13 19:33:22,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:33:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:33:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2025-04-13 19:33:22,707 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2025-04-13 19:33:22,707 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 160 flow. Second operand 6 states and 190 transitions. [2025-04-13 19:33:22,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 95 transitions, 436 flow [2025-04-13 19:33:22,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 430 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:33:22,711 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 224 flow [2025-04-13 19:33:22,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-04-13 19:33:22,712 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2025-04-13 19:33:22,712 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 224 flow [2025-04-13 19:33:22,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:22,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:22,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:22,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:33:22,713 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:22,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2024729994, now seen corresponding path program 1 times [2025-04-13 19:33:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:22,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075292702] [2025-04-13 19:33:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:22,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:33:22,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:33:22,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:22,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:22,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075292702] [2025-04-13 19:33:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075292702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:22,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:22,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:33:22,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805808264] [2025-04-13 19:33:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:22,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:33:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:22,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:33:22,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:33:22,938 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2025-04-13 19:33:22,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:22,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:22,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2025-04-13 19:33:22,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:23,894 INFO L116 PetriNetUnfolderBase]: 8888/13345 cut-off events. [2025-04-13 19:33:23,895 INFO L117 PetriNetUnfolderBase]: For 7826/8668 co-relation queries the response was YES. [2025-04-13 19:33:23,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33924 conditions, 13345 events. 8888/13345 cut-off events. For 7826/8668 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 93325 event pairs, 886 based on Foata normal form. 529/13579 useless extension candidates. Maximal degree in co-relation 33903. Up to 5692 conditions per place. [2025-04-13 19:33:23,962 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 57 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2025-04-13 19:33:23,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 462 flow [2025-04-13 19:33:23,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:33:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:33:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2025-04-13 19:33:23,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7347826086956522 [2025-04-13 19:33:23,963 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 224 flow. Second operand 5 states and 169 transitions. [2025-04-13 19:33:23,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 462 flow [2025-04-13 19:33:24,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 456 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 19:33:24,005 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 285 flow [2025-04-13 19:33:24,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2025-04-13 19:33:24,005 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2025-04-13 19:33:24,005 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 285 flow [2025-04-13 19:33:24,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:24,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:24,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:24,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:33:24,006 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:24,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash -520324096, now seen corresponding path program 1 times [2025-04-13 19:33:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:24,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873878044] [2025-04-13 19:33:24,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:24,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:33:24,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:33:24,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:24,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:24,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873878044] [2025-04-13 19:33:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873878044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:33:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978585373] [2025-04-13 19:33:24,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:24,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:33:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:24,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:33:24,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:33:24,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2025-04-13 19:33:24,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:24,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:24,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2025-04-13 19:33:24,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:25,226 INFO L116 PetriNetUnfolderBase]: 7224/10873 cut-off events. [2025-04-13 19:33:25,226 INFO L117 PetriNetUnfolderBase]: For 12817/14346 co-relation queries the response was YES. [2025-04-13 19:33:25,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31728 conditions, 10873 events. 7224/10873 cut-off events. For 12817/14346 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 72499 event pairs, 474 based on Foata normal form. 418/11020 useless extension candidates. Maximal degree in co-relation 31703. Up to 3472 conditions per place. [2025-04-13 19:33:25,272 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 68 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2025-04-13 19:33:25,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 594 flow [2025-04-13 19:33:25,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:33:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:33:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-04-13 19:33:25,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7391304347826086 [2025-04-13 19:33:25,273 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 285 flow. Second operand 6 states and 204 transitions. [2025-04-13 19:33:25,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 594 flow [2025-04-13 19:33:25,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 578 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:33:25,288 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 355 flow [2025-04-13 19:33:25,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2025-04-13 19:33:25,288 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2025-04-13 19:33:25,288 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 355 flow [2025-04-13 19:33:25,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:25,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:25,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:25,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:33:25,289 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:25,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash -104723854, now seen corresponding path program 1 times [2025-04-13 19:33:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:25,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602759828] [2025-04-13 19:33:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:25,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:25,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:33:25,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:33:25,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:25,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:25,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:25,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602759828] [2025-04-13 19:33:25,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602759828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:25,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:25,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:33:25,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835763322] [2025-04-13 19:33:25,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:25,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:33:25,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:25,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:33:25,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:33:25,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-04-13 19:33:25,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 355 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:25,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:25,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-04-13 19:33:25,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:26,924 INFO L116 PetriNetUnfolderBase]: 12237/20570 cut-off events. [2025-04-13 19:33:26,925 INFO L117 PetriNetUnfolderBase]: For 32175/35915 co-relation queries the response was YES. [2025-04-13 19:33:26,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58294 conditions, 20570 events. 12237/20570 cut-off events. For 32175/35915 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 169837 event pairs, 2956 based on Foata normal form. 555/19603 useless extension candidates. Maximal degree in co-relation 58267. Up to 8603 conditions per place. [2025-04-13 19:33:27,038 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 73 selfloop transitions, 22 changer transitions 27/151 dead transitions. [2025-04-13 19:33:27,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 151 transitions, 947 flow [2025-04-13 19:33:27,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:33:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:33:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 252 transitions. [2025-04-13 19:33:27,040 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6847826086956522 [2025-04-13 19:33:27,040 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 355 flow. Second operand 8 states and 252 transitions. [2025-04-13 19:33:27,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 151 transitions, 947 flow [2025-04-13 19:33:27,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 151 transitions, 916 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 19:33:27,152 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 507 flow [2025-04-13 19:33:27,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=507, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2025-04-13 19:33:27,153 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 31 predicate places. [2025-04-13 19:33:27,153 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 507 flow [2025-04-13 19:33:27,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:27,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:27,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:27,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:33:27,154 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:27,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash 12794538, now seen corresponding path program 2 times [2025-04-13 19:33:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:27,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144016458] [2025-04-13 19:33:27,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:33:27,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:27,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:33:27,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:33:27,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:33:27,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:28,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144016458] [2025-04-13 19:33:28,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144016458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:28,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:28,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:33:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134773801] [2025-04-13 19:33:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:28,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:33:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:28,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:33:28,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:33:28,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2025-04-13 19:33:28,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 507 flow. Second operand has 10 states, 10 states have (on average 20.1) internal successors, (201), 10 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:28,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:28,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2025-04-13 19:33:28,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:32,492 INFO L116 PetriNetUnfolderBase]: 28901/49149 cut-off events. [2025-04-13 19:33:32,493 INFO L117 PetriNetUnfolderBase]: For 100885/109347 co-relation queries the response was YES. [2025-04-13 19:33:32,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152161 conditions, 49149 events. 28901/49149 cut-off events. For 100885/109347 co-relation queries the response was YES. Maximal size of possible extension queue 3335. Compared 471571 event pairs, 3763 based on Foata normal form. 1247/46169 useless extension candidates. Maximal degree in co-relation 152129. Up to 12047 conditions per place. [2025-04-13 19:33:32,816 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 141 selfloop transitions, 64 changer transitions 61/295 dead transitions. [2025-04-13 19:33:32,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 295 transitions, 2394 flow [2025-04-13 19:33:32,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 19:33:32,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 19:33:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 509 transitions. [2025-04-13 19:33:32,819 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6508951406649617 [2025-04-13 19:33:32,819 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 507 flow. Second operand 17 states and 509 transitions. [2025-04-13 19:33:32,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 295 transitions, 2394 flow [2025-04-13 19:33:33,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 295 transitions, 2358 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-04-13 19:33:33,353 INFO L231 Difference]: Finished difference. Result has 106 places, 136 transitions, 1258 flow [2025-04-13 19:33:33,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1258, PETRI_PLACES=106, PETRI_TRANSITIONS=136} [2025-04-13 19:33:33,354 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2025-04-13 19:33:33,354 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 136 transitions, 1258 flow [2025-04-13 19:33:33,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.1) internal successors, (201), 10 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:33,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:33,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:33,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:33:33,354 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:33,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1647314236, now seen corresponding path program 3 times [2025-04-13 19:33:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:33,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516954526] [2025-04-13 19:33:33,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:33:33,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:33,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:33:33,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:33:33,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:33:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:33,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:33,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516954526] [2025-04-13 19:33:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516954526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:33,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:33:33,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318353563] [2025-04-13 19:33:33,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:33,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:33:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:33,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:33:33,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:33:33,546 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2025-04-13 19:33:33,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 136 transitions, 1258 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:33,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:33,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2025-04-13 19:33:33,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:37,648 INFO L116 PetriNetUnfolderBase]: 25380/46346 cut-off events. [2025-04-13 19:33:37,648 INFO L117 PetriNetUnfolderBase]: For 109792/117893 co-relation queries the response was YES. [2025-04-13 19:33:37,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147120 conditions, 46346 events. 25380/46346 cut-off events. For 109792/117893 co-relation queries the response was YES. Maximal size of possible extension queue 3519. Compared 486113 event pairs, 7650 based on Foata normal form. 1578/42795 useless extension candidates. Maximal degree in co-relation 147077. Up to 19613 conditions per place. [2025-04-13 19:33:38,055 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 73 selfloop transitions, 8 changer transitions 8/179 dead transitions. [2025-04-13 19:33:38,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 179 transitions, 1695 flow [2025-04-13 19:33:38,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:33:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:33:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2025-04-13 19:33:38,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7304347826086957 [2025-04-13 19:33:38,056 INFO L175 Difference]: Start difference. First operand has 106 places, 136 transitions, 1258 flow. Second operand 5 states and 168 transitions. [2025-04-13 19:33:38,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 179 transitions, 1695 flow [2025-04-13 19:33:39,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 179 transitions, 1655 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-04-13 19:33:39,077 INFO L231 Difference]: Finished difference. Result has 104 places, 136 transitions, 1258 flow [2025-04-13 19:33:39,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1258, PETRI_PLACES=104, PETRI_TRANSITIONS=136} [2025-04-13 19:33:39,078 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2025-04-13 19:33:39,078 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 136 transitions, 1258 flow [2025-04-13 19:33:39,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:39,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:39,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:39,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:33:39,078 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:39,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1442899902, now seen corresponding path program 4 times [2025-04-13 19:33:39,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:39,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232997075] [2025-04-13 19:33:39,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:33:39,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:39,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 19:33:39,098 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:33:39,098 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:33:39,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:39,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232997075] [2025-04-13 19:33:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232997075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:39,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:39,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:33:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038220673] [2025-04-13 19:33:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:39,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:33:39,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:39,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:33:39,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:33:39,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 46 [2025-04-13 19:33:39,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 136 transitions, 1258 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:39,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:39,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 46 [2025-04-13 19:33:39,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:42,515 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][49], [60#true, 24#L758true, 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 7#L839true, 58#true, Black: 76#(= ~y~0 0), Black: 118#(< (mod ~main$tmp_guard0~0 256) 1), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~__unbuffered_p3_EAX~0 0), 43#L778true, 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:42,515 INFO L286 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,515 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,515 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,515 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,516 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 46#L864true, 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 36#L842true, 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:42,516 INFO L286 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,516 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,516 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:33:42,516 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-04-13 19:33:43,200 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), 36#L842true, Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,201 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,201 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,201 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,201 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,201 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 36#L842true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), 43#L778true, Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,202 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, Black: 106#(< (mod ~main$tmp_guard0~0 256) 1), 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, 36#L842true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,202 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 46#L864true, 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,202 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,202 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,599 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][49], [60#true, 24#L758true, 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 208#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 7#L839true, 58#true, Black: 76#(= ~y~0 0), Black: 118#(< (mod ~main$tmp_guard0~0 256) 1), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~__unbuffered_p3_EAX~0 0), 43#L778true, 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,600 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,600 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,600 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,600 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,601 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 46#L864true, 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~__unbuffered_p3_EAX~0 0), 43#L778true, 36#L842true, Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,601 INFO L286 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,601 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,601 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,601 INFO L289 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-04-13 19:33:43,638 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,638 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,638 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,638 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,638 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,639 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, Black: 106#(< (mod ~main$tmp_guard0~0 256) 1), 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 31#L806true, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,639 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,639 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,988 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 36#L842true, 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,988 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,988 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,988 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,988 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,989 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 36#L842true, 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,989 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,989 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,989 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,989 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, Black: 106#(< (mod ~main$tmp_guard0~0 256) 1), 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~__unbuffered_p3_EAX~0 0), 43#L778true, 36#L842true, Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,990 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 46#L864true, 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:43,990 INFO L286 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:43,990 INFO L289 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-04-13 19:33:44,604 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 118#(< (mod ~main$tmp_guard0~0 256) 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:44,605 INFO L286 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,605 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,605 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,605 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 118#(< (mod ~main$tmp_guard0~0 256) 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 106#(< (mod ~main$tmp_guard0~0 256) 1), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:44,606 INFO L286 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L775-->L778: 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][149], [60#true, Black: 106#(< (mod ~main$tmp_guard0~0 256) 1), 24#L758true, 210#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 133#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~b~0 1)), 56#true, 187#(= ~b~0 1), 153#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 118#(< (mod ~main$tmp_guard0~0 256) 1), 54#true, Black: 79#(and (= ~y~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 151#(and (= ~z$w_buff0~0 ~__unbuffered_p3_EBX~0) (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd0~0 0) (or (< (mod ~z$w_buff1_used~0 256) 1) (= 0 (mod ~z$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 0)), Black: 164#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 94#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 193#(and (= ~__unbuffered_p3_EBX~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 86#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 166#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~__unbuffered_p3_EBX~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 39#P2EXITtrue, Black: 148#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), 58#true, Black: 76#(= ~y~0 0), Black: 135#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0) (= ~b~0 1) (not (= (mod ~main$tmp_guard1~0 256) 0))), 43#L778true, Black: 67#(= ~__unbuffered_p3_EAX~0 0), Black: 124#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0)), 4#L866true, Black: 110#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 130#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 160#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 191#(and (= ~__unbuffered_p3_EBX~0 1) (= ~b~0 1)), 28#P3EXITtrue, 93#(= ~y~0 1), Black: 162#(and (= ~z$r_buff0_thd4~0 1) (<= 1 ~z$w_buff0_used~0) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~b~0 1) (<= (div ~z$w_buff0_used~0 256) 0) (= ~z$r_buff1_thd0~0 0) (= ~z$w_buff0~0 1)), Black: 129#(= ~b~0 1), Black: 88#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 145#true]) [2025-04-13 19:33:44,606 INFO L286 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:44,606 INFO L289 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-04-13 19:33:45,398 INFO L116 PetriNetUnfolderBase]: 42101/63970 cut-off events. [2025-04-13 19:33:45,398 INFO L117 PetriNetUnfolderBase]: For 180288/197283 co-relation queries the response was YES. [2025-04-13 19:33:45,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221237 conditions, 63970 events. 42101/63970 cut-off events. For 180288/197283 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 548718 event pairs, 2402 based on Foata normal form. 3185/64651 useless extension candidates. Maximal degree in co-relation 221195. Up to 23102 conditions per place. [2025-04-13 19:33:45,808 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 78 selfloop transitions, 18 changer transitions 71/218 dead transitions. [2025-04-13 19:33:45,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 1986 flow [2025-04-13 19:33:45,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:33:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:33:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 223 transitions. [2025-04-13 19:33:45,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6925465838509317 [2025-04-13 19:33:45,810 INFO L175 Difference]: Start difference. First operand has 104 places, 136 transitions, 1258 flow. Second operand 7 states and 223 transitions. [2025-04-13 19:33:45,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 1986 flow [2025-04-13 19:33:47,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 218 transitions, 1942 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-13 19:33:47,668 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 837 flow [2025-04-13 19:33:47,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2025-04-13 19:33:47,669 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 51 predicate places. [2025-04-13 19:33:47,669 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 837 flow [2025-04-13 19:33:47,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:47,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:47,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:47,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:33:47,669 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:47,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash 530513162, now seen corresponding path program 1 times [2025-04-13 19:33:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:47,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817021672] [2025-04-13 19:33:47,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:33:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:47,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:33:47,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:33:47,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:47,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817021672] [2025-04-13 19:33:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817021672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:47,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:47,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:33:47,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983622422] [2025-04-13 19:33:47,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:47,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:33:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:47,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:33:47,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:33:47,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2025-04-13 19:33:47,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 837 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:47,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:47,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2025-04-13 19:33:47,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:49,307 INFO L116 PetriNetUnfolderBase]: 8769/17044 cut-off events. [2025-04-13 19:33:49,307 INFO L117 PetriNetUnfolderBase]: For 60644/64533 co-relation queries the response was YES. [2025-04-13 19:33:49,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58197 conditions, 17044 events. 8769/17044 cut-off events. For 60644/64533 co-relation queries the response was YES. Maximal size of possible extension queue 1471. Compared 168765 event pairs, 2698 based on Foata normal form. 393/15358 useless extension candidates. Maximal degree in co-relation 58156. Up to 5314 conditions per place. [2025-04-13 19:33:49,398 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 40 selfloop transitions, 1 changer transitions 59/143 dead transitions. [2025-04-13 19:33:49,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 143 transitions, 1249 flow [2025-04-13 19:33:49,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:33:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:33:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-04-13 19:33:49,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7130434782608696 [2025-04-13 19:33:49,399 INFO L175 Difference]: Start difference. First operand has 106 places, 99 transitions, 837 flow. Second operand 5 states and 164 transitions. [2025-04-13 19:33:49,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 143 transitions, 1249 flow [2025-04-13 19:33:49,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 143 transitions, 1114 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-04-13 19:33:49,829 INFO L231 Difference]: Finished difference. Result has 103 places, 70 transitions, 458 flow [2025-04-13 19:33:49,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=103, PETRI_TRANSITIONS=70} [2025-04-13 19:33:49,830 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2025-04-13 19:33:49,830 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 70 transitions, 458 flow [2025-04-13 19:33:49,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:49,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:49,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:49,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:33:49,830 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:49,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 921741382, now seen corresponding path program 2 times [2025-04-13 19:33:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:49,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499409376] [2025-04-13 19:33:49,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:33:49,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:49,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:33:49,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:33:49,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:33:49,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:33:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:33:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:33:50,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499409376] [2025-04-13 19:33:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499409376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:33:50,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:33:50,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:33:50,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985509167] [2025-04-13 19:33:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:33:50,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:33:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:33:50,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:33:50,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:33:50,113 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 46 [2025-04-13 19:33:50,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 70 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:50,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:33:50,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 46 [2025-04-13 19:33:50,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:33:50,515 INFO L116 PetriNetUnfolderBase]: 2187/4383 cut-off events. [2025-04-13 19:33:50,516 INFO L117 PetriNetUnfolderBase]: For 8483/8833 co-relation queries the response was YES. [2025-04-13 19:33:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13073 conditions, 4383 events. 2187/4383 cut-off events. For 8483/8833 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 35875 event pairs, 853 based on Foata normal form. 79/3824 useless extension candidates. Maximal degree in co-relation 13034. Up to 1378 conditions per place. [2025-04-13 19:33:50,540 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 25 selfloop transitions, 5 changer transitions 25/94 dead transitions. [2025-04-13 19:33:50,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 636 flow [2025-04-13 19:33:50,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:33:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:33:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2025-04-13 19:33:50,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6677018633540373 [2025-04-13 19:33:50,541 INFO L175 Difference]: Start difference. First operand has 103 places, 70 transitions, 458 flow. Second operand 7 states and 215 transitions. [2025-04-13 19:33:50,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 636 flow [2025-04-13 19:33:50,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 602 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-13 19:33:50,581 INFO L231 Difference]: Finished difference. Result has 100 places, 62 transitions, 382 flow [2025-04-13 19:33:50,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=382, PETRI_PLACES=100, PETRI_TRANSITIONS=62} [2025-04-13 19:33:50,582 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2025-04-13 19:33:50,582 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 62 transitions, 382 flow [2025-04-13 19:33:50,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:33:50,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:33:50,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:50,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:33:50,582 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:33:50,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:33:50,583 INFO L85 PathProgramCache]: Analyzing trace with hash -764556258, now seen corresponding path program 3 times [2025-04-13 19:33:50,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:33:50,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027273459] [2025-04-13 19:33:50,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:33:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:33:50,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:33:50,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:33:50,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:33:50,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:33:50,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:33:50,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:33:50,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:33:50,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:33:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:33:50,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:33:50,682 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:33:50,683 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:33:50,684 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:33:50,685 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:33:50,685 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:33:50,685 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:33:50,685 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 19:33:50,685 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:33:50,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:33:50,685 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:33:50,777 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:33:50,777 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:33:50,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:33:50 BasicIcfg [2025-04-13 19:33:50,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:33:50,785 INFO L158 Benchmark]: Toolchain (without parser) took 33298.40ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 116.6MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 19:33:50,785 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:33:50,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.95ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 90.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:33:50,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.48ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 88.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:33:50,785 INFO L158 Benchmark]: Boogie Preprocessor took 43.18ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 85.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:33:50,785 INFO L158 Benchmark]: RCFGBuilder took 627.78ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 105.6MB in the end (delta: -20.4MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2025-04-13 19:33:50,785 INFO L158 Benchmark]: TraceAbstraction took 32188.47ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 104.7MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 19:33:50,790 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.16ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.95ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 90.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.48ms. Allocated memory is still 167.8MB. Free memory was 90.6MB in the beginning and 88.2MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.18ms. Allocated memory is still 167.8MB. Free memory was 88.2MB in the beginning and 85.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 627.78ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 105.6MB in the end (delta: -20.4MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32188.47ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 104.7MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=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] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, t1030=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] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, t1030=1, t1031=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] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L825] 4 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L828] 4 __unbuffered_p3_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L831] 4 __unbuffered_p3_EBX = b VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L754] 1 b = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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] [L757] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, 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] [L769] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L772] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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] [L784] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L834] 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) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 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 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 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 [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 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 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 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 [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029=0, t1030=1, t1031=2, t1032=3, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 859]: 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: 861]: 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, 82 locations, 77 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1961 IncrementalHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 71 mSDtfsCounter, 1961 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1258occurred in iteration=9, InterpolantAutomatonStates: 83, 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.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 1809 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 19:33:50,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...