/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/mix046.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:33:59,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:33:59,287 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:59,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:33:59,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:33:59,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:33:59,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:33:59,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:33:59,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:33:59,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:33:59,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:33:59,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:33:59,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:33:59,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:33:59,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:33:59,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:33:59,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:33:59,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:33:59,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:33:59,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:33:59,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:33:59,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:33:59,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:33:59,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:33:59,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:33:59,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:33:59,319 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:59,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:33:59,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:33:59,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:33:59,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:33:59,518 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:33:59,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2025-04-13 19:34:00,814 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4669c2108/991e57e70a914796a47c0059b9e8f5c9/FLAG18836205c [2025-04-13 19:34:01,029 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:34:01,029 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.oepc.i [2025-04-13 19:34:01,044 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4669c2108/991e57e70a914796a47c0059b9e8f5c9/FLAG18836205c [2025-04-13 19:34:01,816 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4669c2108/991e57e70a914796a47c0059b9e8f5c9 [2025-04-13 19:34:01,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:34:01,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:34:01,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:34:01,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:34:01,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:34:01,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:34:01" (1/1) ... [2025-04-13 19:34:01,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e7b93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:01, skipping insertion in model container [2025-04-13 19:34:01,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:34:01" (1/1) ... [2025-04-13 19:34:01,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:34:02,059 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/mix046.oepc.i[945,958] [2025-04-13 19:34:02,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:34:02,276 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:34:02,301 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/mix046.oepc.i[945,958] [2025-04-13 19:34:02,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:34:02,394 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:34:02,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02 WrapperNode [2025-04-13 19:34:02,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:34:02,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:34:02,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:34:02,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:34:02,402 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:34:02" (1/1) ... [2025-04-13 19:34:02,418 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:34:02" (1/1) ... [2025-04-13 19:34:02,453 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2025-04-13 19:34:02,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:34:02,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:34:02,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:34:02,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:34:02,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,496 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:34:02,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:34:02,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:34:02,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:34:02,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:34:02,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (1/1) ... [2025-04-13 19:34:02,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:34:02,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:34:02,551 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:34:02,553 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:34:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:34:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:34:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:34:02,572 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:34:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:34:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:34:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:34:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:34:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-04-13 19:34:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-04-13 19:34:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:34:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:34:02,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:34:02,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:34:02,574 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:34:02,690 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:34:02,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:34:02,991 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:34:02,991 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:34:02,991 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:34:03,219 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:34:03,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:34:03 BoogieIcfgContainer [2025-04-13 19:34:03,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:34:03,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:34:03,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:34:03,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:34:03,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:34:01" (1/3) ... [2025-04-13 19:34:03,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5e4438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:34:03, skipping insertion in model container [2025-04-13 19:34:03,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:34:02" (2/3) ... [2025-04-13 19:34:03,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5e4438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:34:03, skipping insertion in model container [2025-04-13 19:34:03,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:34:03" (3/3) ... [2025-04-13 19:34:03,230 INFO L128 eAbstractionObserver]: Analyzing ICFG mix046.oepc.i [2025-04-13 19:34:03,243 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:34:03,244 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix046.oepc.i that has 5 procedures, 47 locations, 42 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:34:03,245 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:34:03,305 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:34:03,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:34:03,390 INFO L116 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-04-13 19:34:03,391 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:34:03,393 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 85 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:34:03,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 108 flow [2025-04-13 19:34:03,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2025-04-13 19:34:03,401 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:34:03,411 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;@568894f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:34:03,412 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:34:03,416 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:34:03,417 INFO L116 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-04-13 19:34:03,417 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:34:03,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:03,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-13 19:34:03,419 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:03,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash 12592676, now seen corresponding path program 1 times [2025-04-13 19:34:03,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:03,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019854463] [2025-04-13 19:34:03,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:03,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 19:34:03,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 19:34:03,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:03,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:03,820 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:34:03,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:03,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019854463] [2025-04-13 19:34:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019854463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:03,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:03,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:34:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854815552] [2025-04-13 19:34:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:03,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:34:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:03,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:34:03,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:34:03,850 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 46 [2025-04-13 19:34:03,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:34:03,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:03,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 46 [2025-04-13 19:34:03,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:04,532 INFO L116 PetriNetUnfolderBase]: 2495/3921 cut-off events. [2025-04-13 19:34:04,532 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-13 19:34:04,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 3921 events. 2495/3921 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24426 event pairs, 1647 based on Foata normal form. 0/3733 useless extension candidates. Maximal degree in co-relation 7485. Up to 2779 conditions per place. [2025-04-13 19:34:04,591 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 37 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2025-04-13 19:34:04,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 221 flow [2025-04-13 19:34:04,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:34:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:34:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-13 19:34:04,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-04-13 19:34:04,607 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 108 transitions. [2025-04-13 19:34:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 221 flow [2025-04-13 19:34:04,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 19:34:04,617 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 92 flow [2025-04-13 19:34:04,619 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:34:04,624 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2025-04-13 19:34:04,624 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 92 flow [2025-04-13 19:34:04,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:34:04,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:04,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:34:04,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:34:04,625 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:04,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash -409894727, now seen corresponding path program 1 times [2025-04-13 19:34:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:04,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127384093] [2025-04-13 19:34:04,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:04,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:04,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:34:04,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:34:04,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:04,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:04,951 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:34:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:04,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127384093] [2025-04-13 19:34:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127384093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:34:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180046471] [2025-04-13 19:34:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:04,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:34:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:04,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:34:04,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:34:04,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:34:04,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:34:04,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:04,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:34:04,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:05,820 INFO L116 PetriNetUnfolderBase]: 4683/7339 cut-off events. [2025-04-13 19:34:05,820 INFO L117 PetriNetUnfolderBase]: For 446/446 co-relation queries the response was YES. [2025-04-13 19:34:05,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14387 conditions, 7339 events. 4683/7339 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 50635 event pairs, 1211 based on Foata normal form. 240/7441 useless extension candidates. Maximal degree in co-relation 14377. Up to 5509 conditions per place. [2025-04-13 19:34:05,860 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 34 selfloop transitions, 3 changer transitions 20/72 dead transitions. [2025-04-13 19:34:05,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 278 flow [2025-04-13 19:34:05,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:34:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:34:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-13 19:34:05,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6695652173913044 [2025-04-13 19:34:05,862 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 5 states and 154 transitions. [2025-04-13 19:34:05,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 278 flow [2025-04-13 19:34:05,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:34:05,864 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 115 flow [2025-04-13 19:34:05,864 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-04-13 19:34:05,866 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 1 predicate places. [2025-04-13 19:34:05,866 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 115 flow [2025-04-13 19:34:05,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:34:05,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:05,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:34:05,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:34:05,866 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:05,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1229226458, now seen corresponding path program 1 times [2025-04-13 19:34:05,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:05,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755524195] [2025-04-13 19:34:05,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:05,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 19:34:05,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 19:34:05,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:05,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:06,078 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:34:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:06,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755524195] [2025-04-13 19:34:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755524195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:06,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:34:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441918187] [2025-04-13 19:34:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:06,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:34:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:06,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:34:06,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:34:06,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2025-04-13 19:34:06,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:34:06,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:06,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2025-04-13 19:34:06,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:08,328 INFO L116 PetriNetUnfolderBase]: 18395/26637 cut-off events. [2025-04-13 19:34:08,328 INFO L117 PetriNetUnfolderBase]: For 7490/7525 co-relation queries the response was YES. [2025-04-13 19:34:08,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57582 conditions, 26637 events. 18395/26637 cut-off events. For 7490/7525 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 180056 event pairs, 3141 based on Foata normal form. 920/27433 useless extension candidates. Maximal degree in co-relation 57569. Up to 10093 conditions per place. [2025-04-13 19:34:08,496 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 56 selfloop transitions, 7 changer transitions 43/117 dead transitions. [2025-04-13 19:34:08,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 117 transitions, 509 flow [2025-04-13 19:34:08,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:34:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:34:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions. [2025-04-13 19:34:08,498 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6583850931677019 [2025-04-13 19:34:08,498 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 115 flow. Second operand 7 states and 212 transitions. [2025-04-13 19:34:08,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 117 transitions, 509 flow [2025-04-13 19:34:08,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 117 transitions, 498 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:34:08,588 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 180 flow [2025-04-13 19:34:08,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2025-04-13 19:34:08,588 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 9 predicate places. [2025-04-13 19:34:08,588 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 180 flow [2025-04-13 19:34:08,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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:34:08,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:08,589 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:34:08,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:34:08,589 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:08,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -436325829, now seen corresponding path program 1 times [2025-04-13 19:34:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:08,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072145138] [2025-04-13 19:34:08,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:08,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:34:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:34:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:08,738 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:34:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:08,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072145138] [2025-04-13 19:34:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072145138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:08,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:34:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775374635] [2025-04-13 19:34:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:08,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:34:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:08,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:34:08,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:34:08,745 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:34:08,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:34:08,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:08,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:34:08,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:10,434 INFO L116 PetriNetUnfolderBase]: 13492/20734 cut-off events. [2025-04-13 19:34:10,434 INFO L117 PetriNetUnfolderBase]: For 28779/30115 co-relation queries the response was YES. [2025-04-13 19:34:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54043 conditions, 20734 events. 13492/20734 cut-off events. For 28779/30115 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 154498 event pairs, 4912 based on Foata normal form. 679/20624 useless extension candidates. Maximal degree in co-relation 54024. Up to 15727 conditions per place. [2025-04-13 19:34:10,566 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 40 selfloop transitions, 4 changer transitions 24/87 dead transitions. [2025-04-13 19:34:10,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 458 flow [2025-04-13 19:34:10,566 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:34:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:34:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-04-13 19:34:10,567 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6869565217391305 [2025-04-13 19:34:10,567 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 180 flow. Second operand 5 states and 158 transitions. [2025-04-13 19:34:10,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 458 flow [2025-04-13 19:34:10,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:34:10,607 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 222 flow [2025-04-13 19:34:10,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2025-04-13 19:34:10,607 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 11 predicate places. [2025-04-13 19:34:10,607 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 222 flow [2025-04-13 19:34:10,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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:34:10,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:10,608 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:34:10,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:34:10,608 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:10,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1112815908, now seen corresponding path program 1 times [2025-04-13 19:34:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:10,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555200999] [2025-04-13 19:34:10,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:10,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:10,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:34:10,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:34:10,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:10,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:10,731 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:34:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:10,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555200999] [2025-04-13 19:34:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555200999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:10,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:10,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:34:10,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787838714] [2025-04-13 19:34:10,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:10,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:34:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:10,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:34:10,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:34:10,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:34:10,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:34:10,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:10,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:34:10,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:14,187 INFO L116 PetriNetUnfolderBase]: 28758/40454 cut-off events. [2025-04-13 19:34:14,187 INFO L117 PetriNetUnfolderBase]: For 39116/40739 co-relation queries the response was YES. [2025-04-13 19:34:14,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99711 conditions, 40454 events. 28758/40454 cut-off events. For 39116/40739 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 274850 event pairs, 5057 based on Foata normal form. 1548/40323 useless extension candidates. Maximal degree in co-relation 99689. Up to 21949 conditions per place. [2025-04-13 19:34:14,484 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 56 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2025-04-13 19:34:14,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 436 flow [2025-04-13 19:34:14,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:34:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:34:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-04-13 19:34:14,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7010869565217391 [2025-04-13 19:34:14,485 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 222 flow. Second operand 4 states and 129 transitions. [2025-04-13 19:34:14,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 436 flow [2025-04-13 19:34:14,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 428 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:34:14,539 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 260 flow [2025-04-13 19:34:14,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-04-13 19:34:14,540 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2025-04-13 19:34:14,540 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 260 flow [2025-04-13 19:34:14,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:34:14,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:14,540 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:34:14,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:34:14,540 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:14,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 850731342, now seen corresponding path program 1 times [2025-04-13 19:34:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:14,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022327577] [2025-04-13 19:34:14,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:34:14,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:34:14,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:14,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:14,698 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:34:14,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:14,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022327577] [2025-04-13 19:34:14,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022327577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:14,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:14,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:34:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094692088] [2025-04-13 19:34:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:14,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:34:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:14,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:34:14,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:34:14,713 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 46 [2025-04-13 19:34:14,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:34:14,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:14,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 46 [2025-04-13 19:34:14,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:19,593 INFO L116 PetriNetUnfolderBase]: 41074/61097 cut-off events. [2025-04-13 19:34:19,594 INFO L117 PetriNetUnfolderBase]: For 78110/81777 co-relation queries the response was YES. [2025-04-13 19:34:19,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168685 conditions, 61097 events. 41074/61097 cut-off events. For 78110/81777 co-relation queries the response was YES. Maximal size of possible extension queue 2964. Compared 483996 event pairs, 10218 based on Foata normal form. 1301/58589 useless extension candidates. Maximal degree in co-relation 168661. Up to 23006 conditions per place. [2025-04-13 19:34:20,042 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 107 selfloop transitions, 24 changer transitions 0/147 dead transitions. [2025-04-13 19:34:20,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 147 transitions, 872 flow [2025-04-13 19:34:20,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:34:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:34:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2025-04-13 19:34:20,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6894409937888198 [2025-04-13 19:34:20,044 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 260 flow. Second operand 7 states and 222 transitions. [2025-04-13 19:34:20,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 147 transitions, 872 flow [2025-04-13 19:34:20,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 147 transitions, 866 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-13 19:34:20,095 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 503 flow [2025-04-13 19:34:20,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2025-04-13 19:34:20,096 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2025-04-13 19:34:20,096 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 503 flow [2025-04-13 19:34:20,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:34:20,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:20,096 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:34:20,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:34:20,096 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:20,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1239406184, now seen corresponding path program 1 times [2025-04-13 19:34:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:20,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937972214] [2025-04-13 19:34:20,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:20,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 19:34:20,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:34:20,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:20,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:20,225 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:34:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:20,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937972214] [2025-04-13 19:34:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937972214] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:34:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956975863] [2025-04-13 19:34:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:20,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:34:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:20,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:34:20,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:34:20,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:34:20,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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:34:20,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:20,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:34:20,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:24,989 INFO L116 PetriNetUnfolderBase]: 39755/57850 cut-off events. [2025-04-13 19:34:24,989 INFO L117 PetriNetUnfolderBase]: For 75602/77050 co-relation queries the response was YES. [2025-04-13 19:34:25,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158290 conditions, 57850 events. 39755/57850 cut-off events. For 75602/77050 co-relation queries the response was YES. Maximal size of possible extension queue 2663. Compared 427325 event pairs, 4489 based on Foata normal form. 2462/58271 useless extension candidates. Maximal degree in co-relation 158259. Up to 20966 conditions per place. [2025-04-13 19:34:25,434 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 77 selfloop transitions, 10 changer transitions 1/125 dead transitions. [2025-04-13 19:34:25,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 873 flow [2025-04-13 19:34:25,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:34:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:34:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-04-13 19:34:25,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7217391304347827 [2025-04-13 19:34:25,435 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 503 flow. Second operand 5 states and 166 transitions. [2025-04-13 19:34:25,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 873 flow [2025-04-13 19:34:25,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 859 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-13 19:34:25,772 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 546 flow [2025-04-13 19:34:25,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-04-13 19:34:25,773 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 29 predicate places. [2025-04-13 19:34:25,773 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 546 flow [2025-04-13 19:34:25,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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:34:25,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:25,773 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:34:25,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:34:25,773 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:25,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash 903403664, now seen corresponding path program 1 times [2025-04-13 19:34:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:25,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655959938] [2025-04-13 19:34:25,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:25,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 19:34:25,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 19:34:25,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:25,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:25,989 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:34:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:25,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655959938] [2025-04-13 19:34:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655959938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:25,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:25,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:34:25,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331167070] [2025-04-13 19:34:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:25,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:34:25,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:25,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:34:25,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:34:25,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:34:25,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 546 flow. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:34:25,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:25,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:34:25,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:30,132 INFO L116 PetriNetUnfolderBase]: 31903/46562 cut-off events. [2025-04-13 19:34:30,132 INFO L117 PetriNetUnfolderBase]: For 72248/72680 co-relation queries the response was YES. [2025-04-13 19:34:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139619 conditions, 46562 events. 31903/46562 cut-off events. For 72248/72680 co-relation queries the response was YES. Maximal size of possible extension queue 2309. Compared 336694 event pairs, 3185 based on Foata normal form. 1482/46090 useless extension candidates. Maximal degree in co-relation 139584. Up to 16362 conditions per place. [2025-04-13 19:34:30,502 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 91 selfloop transitions, 14 changer transitions 2/143 dead transitions. [2025-04-13 19:34:30,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 1015 flow [2025-04-13 19:34:30,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:34:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:34:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-04-13 19:34:30,503 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-04-13 19:34:30,503 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 546 flow. Second operand 6 states and 201 transitions. [2025-04-13 19:34:30,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 1015 flow [2025-04-13 19:34:30,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 997 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 19:34:30,576 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 604 flow [2025-04-13 19:34:30,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2025-04-13 19:34:30,577 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 34 predicate places. [2025-04-13 19:34:30,577 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 604 flow [2025-04-13 19:34:30,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:34:30,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:30,577 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:34:30,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:34:30,578 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:30,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1686943206, now seen corresponding path program 1 times [2025-04-13 19:34:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:30,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555658132] [2025-04-13 19:34:30,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:34:30,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:30,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:34:30,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:34:30,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:34:30,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:31,226 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:34:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:31,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555658132] [2025-04-13 19:34:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555658132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:31,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:34:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664879225] [2025-04-13 19:34:31,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:31,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:34:31,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:31,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:34:31,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:34:31,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:34:31,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 604 flow. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 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:34:31,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:31,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:34:31,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:35,509 INFO L116 PetriNetUnfolderBase]: 28718/48714 cut-off events. [2025-04-13 19:34:35,509 INFO L117 PetriNetUnfolderBase]: For 111332/133719 co-relation queries the response was YES. [2025-04-13 19:34:35,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144293 conditions, 48714 events. 28718/48714 cut-off events. For 111332/133719 co-relation queries the response was YES. Maximal size of possible extension queue 3372. Compared 463141 event pairs, 7417 based on Foata normal form. 1407/44675 useless extension candidates. Maximal degree in co-relation 144256. Up to 18464 conditions per place. [2025-04-13 19:34:35,899 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 80 selfloop transitions, 20 changer transitions 19/171 dead transitions. [2025-04-13 19:34:35,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 171 transitions, 1272 flow [2025-04-13 19:34:35,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:34:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:34:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 273 transitions. [2025-04-13 19:34:35,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7418478260869565 [2025-04-13 19:34:35,901 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 604 flow. Second operand 8 states and 273 transitions. [2025-04-13 19:34:35,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 171 transitions, 1272 flow [2025-04-13 19:34:36,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 171 transitions, 1235 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-04-13 19:34:36,526 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 719 flow [2025-04-13 19:34:36,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=719, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-04-13 19:34:36,527 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2025-04-13 19:34:36,527 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 719 flow [2025-04-13 19:34:36,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 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:34:36,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:36,527 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:34:36,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:34:36,527 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:36,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash -476557606, now seen corresponding path program 2 times [2025-04-13 19:34:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:36,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811181623] [2025-04-13 19:34:36,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:34:36,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:36,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:34:36,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:34:36,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:34:36,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:37,766 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:34:37,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:37,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811181623] [2025-04-13 19:34:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811181623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:37,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:34:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299465705] [2025-04-13 19:34:37,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:37,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:34:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:37,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:34:37,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:34:37,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:34:37,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 719 flow. Second operand has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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:34:37,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:37,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:34:37,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:45,006 INFO L116 PetriNetUnfolderBase]: 43799/74156 cut-off events. [2025-04-13 19:34:45,007 INFO L117 PetriNetUnfolderBase]: For 193830/225025 co-relation queries the response was YES. [2025-04-13 19:34:45,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246813 conditions, 74156 events. 43799/74156 cut-off events. For 193830/225025 co-relation queries the response was YES. Maximal size of possible extension queue 5269. Compared 747426 event pairs, 11570 based on Foata normal form. 3188/68877 useless extension candidates. Maximal degree in co-relation 246771. Up to 14664 conditions per place. [2025-04-13 19:34:45,777 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 102 selfloop transitions, 16 changer transitions 17/187 dead transitions. [2025-04-13 19:34:45,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 187 transitions, 1589 flow [2025-04-13 19:34:45,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:34:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:34:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 300 transitions. [2025-04-13 19:34:45,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7246376811594203 [2025-04-13 19:34:45,779 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 719 flow. Second operand 9 states and 300 transitions. [2025-04-13 19:34:45,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 187 transitions, 1589 flow [2025-04-13 19:34:47,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 187 transitions, 1531 flow, removed 22 selfloop flow, removed 6 redundant places. [2025-04-13 19:34:47,065 INFO L231 Difference]: Finished difference. Result has 102 places, 102 transitions, 834 flow [2025-04-13 19:34:47,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=834, PETRI_PLACES=102, PETRI_TRANSITIONS=102} [2025-04-13 19:34:47,066 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 47 predicate places. [2025-04-13 19:34:47,066 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 102 transitions, 834 flow [2025-04-13 19:34:47,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 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:34:47,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:34:47,066 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:34:47,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:34:47,067 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:34:47,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:34:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash -440002442, now seen corresponding path program 3 times [2025-04-13 19:34:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:34:47,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292211075] [2025-04-13 19:34:47,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:34:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:34:47,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-04-13 19:34:47,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 19:34:47,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:34:47,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:34:47,268 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:34:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:34:47,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292211075] [2025-04-13 19:34:47,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292211075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:34:47,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:34:47,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:34:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633822100] [2025-04-13 19:34:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:34:47,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:34:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:34:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:34:47,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:34:47,275 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2025-04-13 19:34:47,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 834 flow. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:34:47,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:34:47,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2025-04-13 19:34:47,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:34:49,418 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][33], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 20#L852true, Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 192#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true, 31#L813true, 127#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:49,419 INFO L286 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-04-13 19:34:49,419 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:34:49,419 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:34:49,419 INFO L289 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-04-13 19:34:50,120 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][33], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 20#L852true, Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 192#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 31#L813true, 127#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:50,120 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,121 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,121 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,121 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,122 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][69], [60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, 27#L855true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true, 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:50,122 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,122 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,122 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,122 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-04-13 19:34:50,970 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][69], [60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, 27#L855true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:50,971 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,971 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,971 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,971 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,973 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][69], [60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 9#P3EXITtrue, Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true, 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:50,973 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,973 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,973 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,973 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,973 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][69], [60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, 27#L855true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:50,973 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,974 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,974 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:50,974 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-04-13 19:34:52,047 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][69], [60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 9#P3EXITtrue, Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:52,047 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,048 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,048 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,048 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,050 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([398] L806-->L813: Formula: (let ((.cse0 (not (= 0 (mod v_~b$w_buff0_used~0_81 256)))) (.cse1 (not (= (mod v_~b$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~b$r_buff0_thd3~0_18 256) 0)))) (let ((.cse3 (and (not (= (mod v_~b$w_buff0_used~0_82 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~b$w_buff1_used~0_61 256) 0)) .cse1)) (.cse2 (and .cse0 .cse5))) (and (= (ite (= (mod (ite (or (and (not (= (mod v_~b$r_buff0_thd3~0_17 256) 0)) .cse0) (and (not (= (mod v_~b$w_buff1_used~0_60 256) 0)) .cse1)) 0 v_~b$r_buff1_thd3~0_14) 256) 0) 0 1) v_~b$r_buff1_thd3~0_13) (= (ite (= (mod (ite .cse2 0 v_~b$r_buff0_thd3~0_18) 256) 0) 0 1) v_~b$r_buff0_thd3~0_17) (= v_~b~0_42 (ite .cse3 v_~b$w_buff0~0_44 (ite .cse4 v_~b$w_buff1~0_33 v_~b~0_43))) (= v_~b$w_buff0_used~0_81 (ite (= (mod (ite .cse3 0 v_~b$w_buff0_used~0_82) 256) 0) 0 1)) (= v_~b$w_buff1_used~0_60 (ite (= (mod (ite (or .cse4 .cse2) 0 v_~b$w_buff1_used~0_61) 256) 0) 0 1))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_82, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_18, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_61, ~b~0=v_~b~0_43, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_14} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_81, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_17, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_60, ~b~0=v_~b~0_42, ~b$w_buff1~0=v_~b$w_buff1~0_33, ~b$w_buff0~0=v_~b$w_buff0~0_44, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_13} AuxVars[] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, ~b$r_buff1_thd3~0][69], [60#true, 30#L766true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 76#(= ~__unbuffered_p3_EAX~0 0), 54#true, Black: 91#(= ~y~0 0), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (not (= (mod ~main$tmp_guard1~0 256) 0)) (= ~b$w_buff0~0 ~b~0)), 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 58#true, 45#L786true, Black: 108#(= ~y~0 1), Black: 70#(and (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), 9#P3EXITtrue, Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, Black: 114#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 67#(= ~z~0 0), Black: 94#(and (= ~y~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), Black: 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 177#(and (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (mod ~main$tmp_guard1~0 256) 0)))]) [2025-04-13 19:34:52,051 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,051 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,051 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:34:52,051 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-04-13 19:34:58,342 INFO L116 PetriNetUnfolderBase]: 85220/124332 cut-off events. [2025-04-13 19:34:58,343 INFO L117 PetriNetUnfolderBase]: For 443817/459023 co-relation queries the response was YES. [2025-04-13 19:34:59,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474787 conditions, 124332 events. 85220/124332 cut-off events. For 443817/459023 co-relation queries the response was YES. Maximal size of possible extension queue 5765. Compared 1000247 event pairs, 6566 based on Foata normal form. 2358/123142 useless extension candidates. Maximal degree in co-relation 474743. Up to 45375 conditions per place. [2025-04-13 19:34:59,412 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 125 selfloop transitions, 18 changer transitions 39/215 dead transitions. [2025-04-13 19:34:59,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 215 transitions, 2115 flow [2025-04-13 19:34:59,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:34:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:34:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2025-04-13 19:34:59,413 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6645962732919255 [2025-04-13 19:34:59,413 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 834 flow. Second operand 7 states and 214 transitions. [2025-04-13 19:34:59,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 215 transitions, 2115 flow [2025-04-13 19:35:05,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 215 transitions, 2033 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-04-13 19:35:05,322 INFO L231 Difference]: Finished difference. Result has 101 places, 92 transitions, 711 flow [2025-04-13 19:35:05,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=711, PETRI_PLACES=101, PETRI_TRANSITIONS=92} [2025-04-13 19:35:05,323 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 46 predicate places. [2025-04-13 19:35:05,323 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 711 flow [2025-04-13 19:35:05,323 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 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:35:05,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:05,323 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:35:05,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:35:05,323 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:35:05,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash 851437703, now seen corresponding path program 1 times [2025-04-13 19:35:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:05,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626253344] [2025-04-13 19:35:05,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:05,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:35:05,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:35:05,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:05,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:05,502 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:35:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:05,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626253344] [2025-04-13 19:35:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626253344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:05,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:05,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:35:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236423250] [2025-04-13 19:35:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:05,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:35:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:05,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:35:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:35:05,511 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2025-04-13 19:35:05,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 711 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:35:05,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:05,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2025-04-13 19:35:05,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:06,941 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 192#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 91#(= ~y~0 0), 54#true, Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 22#L773true, 19#L829true, 45#L786true, 58#true, Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 108#(= ~y~0 1), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true, 31#L813true, 127#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2025-04-13 19:35:06,941 INFO L286 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2025-04-13 19:35:06,942 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2025-04-13 19:35:06,942 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2025-04-13 19:35:06,942 INFO L289 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2025-04-13 19:35:07,943 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 21#P0EXITtrue, 45#L786true, 19#L829true, 58#true, Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 108#(= ~y~0 1), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true, 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2025-04-13 19:35:07,944 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,944 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,944 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,944 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,965 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 22#L773true, 19#L829true, 45#L786true, 58#true, 48#P2EXITtrue, Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 108#(= ~y~0 1), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2025-04-13 19:35:07,965 INFO L286 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,965 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,965 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-04-13 19:35:07,965 INFO L289 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2025-04-13 19:35:08,321 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 21#P0EXITtrue, 19#L829true, 58#true, 45#L786true, Black: 74#true, 14#L879true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 67#(= ~z~0 0), 108#(= ~y~0 1), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 31#L813true, 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2025-04-13 19:35:08,322 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,322 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,322 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,322 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,333 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 46#L776true, 19#L829true, 48#P2EXITtrue, 58#true, 45#L786true, 196#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 67#(= ~z~0 0), 108#(= ~y~0 1), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 125#(< (mod ~main$tmp_guard0~0 256) 1), 203#(= ~x~0 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true]) [2025-04-13 19:35:08,333 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,333 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,333 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,333 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,348 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 125#(< (mod ~main$tmp_guard0~0 256) 1), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 194#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 22#L773true, 19#L829true, 58#true, 48#P2EXITtrue, 45#L786true, Black: 74#true, 14#L879true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 67#(= ~z~0 0), 108#(= ~y~0 1), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0))]) [2025-04-13 19:35:08,348 INFO L286 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,348 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,348 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,348 INFO L289 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2025-04-13 19:35:08,729 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [60#true, Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 91#(= ~y~0 0), 54#true, Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 21#P0EXITtrue, 45#L786true, 48#P2EXITtrue, 19#L829true, 58#true, 196#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 108#(= ~y~0 1), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), 125#(< (mod ~main$tmp_guard0~0 256) 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0)), 12#L877true]) [2025-04-13 19:35:08,729 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,729 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,729 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,729 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,743 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 46#L776true, 19#L829true, 48#P2EXITtrue, 58#true, 45#L786true, 196#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 74#true, 14#L879true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 67#(= ~z~0 0), 108#(= ~y~0 1), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), 125#(< (mod ~main$tmp_guard0~0 256) 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0))]) [2025-04-13 19:35:08,744 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 91#(= ~y~0 0), 54#true, Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 46#L776true, 45#L786true, 19#L829true, 48#P2EXITtrue, 58#true, 196#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, 108#(= ~y~0 1), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), 125#(< (mod ~main$tmp_guard0~0 256) 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0))]) [2025-04-13 19:35:08,744 INFO L286 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:08,744 INFO L289 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2025-04-13 19:35:09,149 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), 60#true, Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 21#P0EXITtrue, 19#L829true, 48#P2EXITtrue, 58#true, 45#L786true, 196#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 74#true, 14#L879true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 67#(= ~z~0 0), 108#(= ~y~0 1), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), 125#(< (mod ~main$tmp_guard0~0 256) 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0))]) [2025-04-13 19:35:09,149 INFO L286 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,149 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,149 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,149 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,150 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([391] L783-->L786: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [60#true, Black: 129#(and (<= ~__unbuffered_cnt~0 1) (<= (mod ~main$tmp_guard0~0 256) 0)), Black: 150#(and (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), Black: 137#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 82#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (not (= (mod ~main$tmp_guard1~0 256) 0))), Black: 101#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (not (= ~__unbuffered_p3_EBX~0 0)) (or (= (mod ~b$w_buff0_used~0 256) 0) (and (not (= ~b$w_buff0~0 0)) (<= 0 (div ~b$w_buff1_used~0 256)) (<= (mod ~b$w_buff1_used~0 256) 0))) (not (= ~b~0 0))), 56#true, 166#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 103#(and (= ~__unbuffered_cnt~0 0) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 54#true, Black: 91#(= ~y~0 0), Black: 109#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 173#(and (= ~b$r_buff0_thd4~0 0) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b~0 ~__unbuffered_p3_EBX~0) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0~0 ~b~0)), Black: 165#(and (= ~b$r_buff0_thd4~0 0) (= ~b$r_buff0_thd1~0 1) (= 0 ~b$r_buff1_thd3~0) (not (= ~b$w_buff0~0 0)) (= ~b$r_buff0_thd0~0 0) (= (mod ~b$r_buff0_thd3~0 256) 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$w_buff1~0 0) (= 0 ~b$r_buff1_thd0~0) (= ~b$w_buff0_used~0 1)), 21#P0EXITtrue, 48#P2EXITtrue, 19#L829true, 45#L786true, 58#true, 196#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 74#true, 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 14#L879true, 108#(= ~y~0 1), Black: 67#(= ~z~0 0), Black: 149#(and (= ~b$r_buff0_thd1~0 1) (not (= ~b$w_buff0~0 0)) (= ~b$w_buff1~0 0) (= ~b$w_buff0_used~0 1)), 203#(= ~x~0 1), 125#(< (mod ~main$tmp_guard0~0 256) 1), Black: 106#true, Black: 170#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 198#(and (<= ~__unbuffered_cnt~0 3) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), 143#(and (<= ~__unbuffered_cnt~0 2) (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 190#(and (<= (mod ~main$tmp_guard0~0 256) 0) (<= 0 ~main$tmp_guard0~0)), Black: 151#(not (= ~__unbuffered_p3_EBX~0 0))]) [2025-04-13 19:35:09,150 INFO L286 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,150 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,150 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-04-13 19:35:09,150 INFO L289 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2025-04-13 19:35:11,211 INFO L116 PetriNetUnfolderBase]: 39393/67323 cut-off events. [2025-04-13 19:35:11,212 INFO L117 PetriNetUnfolderBase]: For 255813/282699 co-relation queries the response was YES. [2025-04-13 19:35:11,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244324 conditions, 67323 events. 39393/67323 cut-off events. For 255813/282699 co-relation queries the response was YES. Maximal size of possible extension queue 4764. Compared 674640 event pairs, 11057 based on Foata normal form. 1643/61022 useless extension candidates. Maximal degree in co-relation 244283. Up to 26581 conditions per place. [2025-04-13 19:35:11,791 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 80 selfloop transitions, 4 changer transitions 19/151 dead transitions. [2025-04-13 19:35:11,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 151 transitions, 1292 flow [2025-04-13 19:35:11,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-04-13 19:35:11,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6782608695652174 [2025-04-13 19:35:11,792 INFO L175 Difference]: Start difference. First operand has 101 places, 92 transitions, 711 flow. Second operand 5 states and 156 transitions. [2025-04-13 19:35:11,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 151 transitions, 1292 flow [2025-04-13 19:35:15,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 151 transitions, 1187 flow, removed 41 selfloop flow, removed 9 redundant places. [2025-04-13 19:35:15,733 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 657 flow [2025-04-13 19:35:15,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=657, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-04-13 19:35:15,734 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 40 predicate places. [2025-04-13 19:35:15,734 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 657 flow [2025-04-13 19:35:15,734 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:35:15,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:15,735 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:35:15,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:35:15,735 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:35:15,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:15,735 INFO L85 PathProgramCache]: Analyzing trace with hash 243588767, now seen corresponding path program 2 times [2025-04-13 19:35:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:15,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419974676] [2025-04-13 19:35:15,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:15,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:35:15,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:35:15,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:15,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:16,295 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:35:16,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:16,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419974676] [2025-04-13 19:35:16,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419974676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:16,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:35:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400780030] [2025-04-13 19:35:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:16,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:35:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:16,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:35:16,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:35:16,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:35:16,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 657 flow. Second operand has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 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:35:16,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:16,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:35:16,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:22,724 INFO L116 PetriNetUnfolderBase]: 40826/72415 cut-off events. [2025-04-13 19:35:22,724 INFO L117 PetriNetUnfolderBase]: For 188909/221386 co-relation queries the response was YES. [2025-04-13 19:35:23,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233539 conditions, 72415 events. 40826/72415 cut-off events. For 188909/221386 co-relation queries the response was YES. Maximal size of possible extension queue 5776. Compared 774468 event pairs, 12014 based on Foata normal form. 1855/65533 useless extension candidates. Maximal degree in co-relation 233501. Up to 37393 conditions per place. [2025-04-13 19:35:23,302 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 84 selfloop transitions, 18 changer transitions 7/163 dead transitions. [2025-04-13 19:35:23,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 163 transitions, 1266 flow [2025-04-13 19:35:23,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:35:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:35:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2025-04-13 19:35:23,303 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2025-04-13 19:35:23,303 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 657 flow. Second operand 8 states and 248 transitions. [2025-04-13 19:35:23,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 163 transitions, 1266 flow [2025-04-13 19:35:29,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 163 transitions, 1263 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 19:35:29,088 INFO L231 Difference]: Finished difference. Result has 104 places, 109 transitions, 895 flow [2025-04-13 19:35:29,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=895, PETRI_PLACES=104, PETRI_TRANSITIONS=109} [2025-04-13 19:35:29,088 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 49 predicate places. [2025-04-13 19:35:29,088 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 109 transitions, 895 flow [2025-04-13 19:35:29,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 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:35:29,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:29,089 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:35:29,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:35:29,089 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:35:29,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1086826375, now seen corresponding path program 3 times [2025-04-13 19:35:29,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:29,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408289581] [2025-04-13 19:35:29,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:35:29,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:29,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:35:29,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:35:29,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:35:29,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:29,936 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:35:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:29,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408289581] [2025-04-13 19:35:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408289581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:35:29,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177156359] [2025-04-13 19:35:29,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:29,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:35:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:29,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:35:29,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:35:29,954 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2025-04-13 19:35:29,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 895 flow. Second operand has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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:35:29,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:29,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2025-04-13 19:35:29,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:39,732 INFO L116 PetriNetUnfolderBase]: 59263/104077 cut-off events. [2025-04-13 19:35:39,732 INFO L117 PetriNetUnfolderBase]: For 317109/359025 co-relation queries the response was YES. [2025-04-13 19:35:40,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345397 conditions, 104077 events. 59263/104077 cut-off events. For 317109/359025 co-relation queries the response was YES. Maximal size of possible extension queue 8239. Compared 1157932 event pairs, 16784 based on Foata normal form. 3702/94557 useless extension candidates. Maximal degree in co-relation 345354. Up to 29179 conditions per place. [2025-04-13 19:35:40,640 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 91 selfloop transitions, 18 changer transitions 8/171 dead transitions. [2025-04-13 19:35:40,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 1513 flow [2025-04-13 19:35:40,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2025-04-13 19:35:40,641 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7080745341614907 [2025-04-13 19:35:40,642 INFO L175 Difference]: Start difference. First operand has 104 places, 109 transitions, 895 flow. Second operand 7 states and 228 transitions. [2025-04-13 19:35:40,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 1513 flow [2025-04-13 19:35:56,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 171 transitions, 1481 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-13 19:35:56,530 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 1005 flow [2025-04-13 19:35:56,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1005, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2025-04-13 19:35:56,530 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2025-04-13 19:35:56,531 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 1005 flow [2025-04-13 19:35:56,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.11111111111111) internal successors, (208), 9 states have internal predecessors, (208), 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:35:56,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:56,531 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:35:56,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:35:56,531 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 19:35:56,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 413712135, now seen corresponding path program 4 times [2025-04-13 19:35:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:56,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066414209] [2025-04-13 19:35:56,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:35:56,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:56,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 19:35:56,579 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:35:56,579 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:35:56,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:35:56,579 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:35:56,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 19:35:56,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 19:35:56,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:56,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:35:56,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:35:56,656 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:35:56,656 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:35:56,657 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:35:56,657 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:35:56,657 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:35:56,657 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:35:56,658 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 19:35:56,658 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:35:56,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:35:56,658 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:56,753 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:35:56,753 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:35:56,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:35:56 BasicIcfg [2025-04-13 19:35:56,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:35:56,759 INFO L158 Benchmark]: Toolchain (without parser) took 114940.51ms. Allocated memory was 155.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 106.9MB in the beginning and 954.2MB in the end (delta: -847.3MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-04-13 19:35:56,759 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:35:56,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.37ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 79.7MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.18ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,760 INFO L158 Benchmark]: Boogie Preprocessor took 67.89ms. Allocated memory is still 155.2MB. Free memory was 77.2MB in the beginning and 73.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,760 INFO L158 Benchmark]: RCFGBuilder took 698.32ms. Allocated memory is still 155.2MB. Free memory was 73.5MB in the beginning and 78.5MB in the end (delta: -5.0MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,760 INFO L158 Benchmark]: TraceAbstraction took 113535.03ms. Allocated memory was 155.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 77.8MB in the beginning and 954.2MB in the end (delta: -876.4MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-04-13 19:35:56,764 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.17ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 576.37ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 79.7MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.18ms. Allocated memory is still 155.2MB. Free memory was 79.7MB in the beginning and 77.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.89ms. Allocated memory is still 155.2MB. Free memory was 77.2MB in the beginning and 73.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 698.32ms. Allocated memory is still 155.2MB. Free memory was 73.5MB in the beginning and 78.5MB in the end (delta: -5.0MB). Peak memory consumption was 57.7MB. Max. memory is 8.0GB. * TraceAbstraction took 113535.03ms. Allocated memory was 155.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 77.8MB in the beginning and 954.2MB in the end (delta: -876.4MB). Peak memory consumption was 2.6GB. 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1217; [L870] FCALL, FORK 0 pthread_create(&t1217, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1218; [L872] FCALL, FORK 0 pthread_create(&t1218, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-3, t1218=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1219; [L874] FCALL, FORK 0 pthread_create(&t1219, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-3, t1218=-2, t1219=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1220; [L876] FCALL, FORK 0 pthread_create(&t1220, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1217=-3, t1218=-2, t1219=-1, t1220=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L825] 4 a = 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_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L775] 1 __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=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L795] 2 __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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L815] 3 __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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L878] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217=-3, t1218=-2, t1219=-1, t1220=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217=-3, t1218=-2, t1219=-1, t1220=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1217=-3, t1218=-2, t1219=-1, t1220=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] [L891] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 113.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 107.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 907 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2608 IncrementalHoareTripleChecker+Invalid, 2689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 45 mSDtfsCounter, 2608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1005occurred in iteration=14, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 2522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 19:35:56,778 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...