/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:26,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:26,258 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-14 00:10:26,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:26,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:26,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:26,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:26,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:26,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:26,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:26,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:26,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:26,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:26,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:26,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:26,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:26,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:26,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:26,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:26,282 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:26,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:26,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:26,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:26,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:26,516 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:26,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe028_power.i [2025-04-14 00:10:27,896 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5479d50ef/6ca5f80417a549d4b5e38f558907828e/FLAG00ea5fd03 [2025-04-14 00:10:28,187 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:28,187 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_power.i [2025-04-14 00:10:28,199 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5479d50ef/6ca5f80417a549d4b5e38f558907828e/FLAG00ea5fd03 [2025-04-14 00:10:28,947 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5479d50ef/6ca5f80417a549d4b5e38f558907828e [2025-04-14 00:10:28,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:28,950 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:28,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:28,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:28,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:28,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:28" (1/1) ... [2025-04-14 00:10:28,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9d90cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:28, skipping insertion in model container [2025-04-14 00:10:28,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:28" (1/1) ... [2025-04-14 00:10:28,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:29,175 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/safe028_power.i[990,1003] [2025-04-14 00:10:29,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:29,403 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:29,430 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/safe028_power.i[990,1003] [2025-04-14 00:10:29,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:29,527 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:29,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29 WrapperNode [2025-04-14 00:10:29,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:29,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:29,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:29,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:29,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,576 INFO L138 Inliner]: procedures = 175, calls = 65, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2025-04-14 00:10:29,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:29,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:29,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:29,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:29,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,606 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2025-04-14 00:10:29,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:29,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:29,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:29,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:29,634 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (1/1) ... [2025-04-14 00:10:29,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:29,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:29,671 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-14 00:10:29,673 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-14 00:10:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:10:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:10:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:10:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:10:29,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:29,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:29,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:10:29,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:29,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:29,696 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:10:29,813 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:29,815 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:30,250 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:30,251 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:30,251 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:30,708 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:30,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:30 BoogieIcfgContainer [2025-04-14 00:10:30,708 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:30,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:30,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:30,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:30,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:28" (1/3) ... [2025-04-14 00:10:30,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57abd130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:30, skipping insertion in model container [2025-04-14 00:10:30,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:29" (2/3) ... [2025-04-14 00:10:30,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57abd130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:30, skipping insertion in model container [2025-04-14 00:10:30,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:30" (3/3) ... [2025-04-14 00:10:30,717 INFO L128 eAbstractionObserver]: Analyzing ICFG safe028_power.i [2025-04-14 00:10:30,731 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:30,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe028_power.i that has 4 procedures, 36 locations, 32 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:10:30,732 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:30,792 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:30,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 82 flow [2025-04-14 00:10:30,844 INFO L116 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-04-14 00:10:30,846 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:30,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:10:30,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 35 transitions, 82 flow [2025-04-14 00:10:30,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-04-14 00:10:30,863 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:30,871 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;@479deb9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:30,871 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:10:30,875 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:30,875 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-14 00:10:30,875 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:30,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:30,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:10:30,876 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:30,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1437235608, now seen corresponding path program 1 times [2025-04-14 00:10:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:30,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951151980] [2025-04-14 00:10:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:30,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:10:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:10:31,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:31,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:31,340 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-14 00:10:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:31,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951151980] [2025-04-14 00:10:31,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951151980] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:31,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:31,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:10:31,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227753346] [2025-04-14 00:10:31,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:31,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:10:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:31,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:10:31,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:10:31,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:31,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-14 00:10:31,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:31,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:31,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:32,334 INFO L116 PetriNetUnfolderBase]: 4103/5874 cut-off events. [2025-04-14 00:10:32,335 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-14 00:10:32,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11833 conditions, 5874 events. 4103/5874 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 30537 event pairs, 551 based on Foata normal form. 0/5660 useless extension candidates. Maximal degree in co-relation 11822. Up to 4953 conditions per place. [2025-04-14 00:10:32,375 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 44 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2025-04-14 00:10:32,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 210 flow [2025-04-14 00:10:32,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:10:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:10:32,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-14 00:10:32,386 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-04-14 00:10:32,387 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 67 transitions. [2025-04-14 00:10:32,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 210 flow [2025-04-14 00:10:32,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:32,393 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 70 flow [2025-04-14 00:10:32,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2025-04-14 00:10:32,397 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-04-14 00:10:32,397 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 70 flow [2025-04-14 00:10:32,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-14 00:10:32,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:32,397 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:32,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:10:32,398 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:32,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash 741624207, now seen corresponding path program 1 times [2025-04-14 00:10:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:32,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837146405] [2025-04-14 00:10:32,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:32,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:10:32,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:10:32,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:32,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:32,637 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-14 00:10:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:32,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837146405] [2025-04-14 00:10:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837146405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:10:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468294354] [2025-04-14 00:10:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:32,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:10:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:32,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:10:32,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:10:32,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:32,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:10:32,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:32,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:32,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:33,356 INFO L116 PetriNetUnfolderBase]: 3053/4527 cut-off events. [2025-04-14 00:10:33,357 INFO L117 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-04-14 00:10:33,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 4527 events. 3053/4527 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 23297 event pairs, 504 based on Foata normal form. 210/4732 useless extension candidates. Maximal degree in co-relation 9375. Up to 2466 conditions per place. [2025-04-14 00:10:33,389 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 54 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2025-04-14 00:10:33,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 264 flow [2025-04-14 00:10:33,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:10:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:10:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-14 00:10:33,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-04-14 00:10:33,392 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 70 flow. Second operand 4 states and 86 transitions. [2025-04-14 00:10:33,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 264 flow [2025-04-14 00:10:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:33,395 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 100 flow [2025-04-14 00:10:33,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2025-04-14 00:10:33,396 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2025-04-14 00:10:33,396 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 100 flow [2025-04-14 00:10:33,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:10:33,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:33,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:33,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:10:33,397 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:33,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1084140944, now seen corresponding path program 1 times [2025-04-14 00:10:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:33,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247157376] [2025-04-14 00:10:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:33,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:10:33,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:10:33,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:33,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:33,719 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-14 00:10:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:33,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247157376] [2025-04-14 00:10:33,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247157376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727080089] [2025-04-14 00:10:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:33,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:33,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:33,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-14 00:10:33,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:33,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:33,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:34,156 INFO L116 PetriNetUnfolderBase]: 1792/2736 cut-off events. [2025-04-14 00:10:34,157 INFO L117 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-04-14 00:10:34,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 2736 events. 1792/2736 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12914 event pairs, 318 based on Foata normal form. 150/2881 useless extension candidates. Maximal degree in co-relation 6427. Up to 939 conditions per place. [2025-04-14 00:10:34,168 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 69 selfloop transitions, 8 changer transitions 1/81 dead transitions. [2025-04-14 00:10:34,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 373 flow [2025-04-14 00:10:34,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-14 00:10:34,170 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-04-14 00:10:34,170 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 100 flow. Second operand 5 states and 110 transitions. [2025-04-14 00:10:34,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 373 flow [2025-04-14 00:10:34,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 81 transitions, 363 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:10:34,173 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 140 flow [2025-04-14 00:10:34,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-04-14 00:10:34,173 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2025-04-14 00:10:34,173 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 140 flow [2025-04-14 00:10:34,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-14 00:10:34,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:34,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:34,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:10:34,174 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:34,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2046298685, now seen corresponding path program 1 times [2025-04-14 00:10:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:34,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079330259] [2025-04-14 00:10:34,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:34,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:10:34,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:10:34,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:34,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:34,556 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-14 00:10:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:34,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079330259] [2025-04-14 00:10:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079330259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:34,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:10:34,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911188245] [2025-04-14 00:10:34,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:34,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:10:34,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:34,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:10:34,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:10:34,560 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:34,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-14 00:10:34,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:34,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:34,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:34,908 INFO L116 PetriNetUnfolderBase]: 1125/1735 cut-off events. [2025-04-14 00:10:34,908 INFO L117 PetriNetUnfolderBase]: For 1090/1090 co-relation queries the response was YES. [2025-04-14 00:10:34,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4411 conditions, 1735 events. 1125/1735 cut-off events. For 1090/1090 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7571 event pairs, 283 based on Foata normal form. 56/1786 useless extension candidates. Maximal degree in co-relation 4397. Up to 658 conditions per place. [2025-04-14 00:10:34,918 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 58 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2025-04-14 00:10:34,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 364 flow [2025-04-14 00:10:34,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:10:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:10:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-04-14 00:10:34,921 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-04-14 00:10:34,921 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 140 flow. Second operand 6 states and 108 transitions. [2025-04-14 00:10:34,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 364 flow [2025-04-14 00:10:34,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 339 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:10:34,931 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 154 flow [2025-04-14 00:10:34,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-04-14 00:10:34,932 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2025-04-14 00:10:34,932 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 154 flow [2025-04-14 00:10:34,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-14 00:10:34,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:34,933 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] [2025-04-14 00:10:34,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:10:34,933 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:34,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1393358780, now seen corresponding path program 1 times [2025-04-14 00:10:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:34,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647242892] [2025-04-14 00:10:34,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:34,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:34,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:10:35,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:35,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:35,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:35,405 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-14 00:10:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:35,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647242892] [2025-04-14 00:10:35,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647242892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:35,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:35,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:10:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654065056] [2025-04-14 00:10:35,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:35,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:10:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:35,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:10:35,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:10:35,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:35,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-14 00:10:35,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:35,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:35,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:35,812 INFO L116 PetriNetUnfolderBase]: 1525/2346 cut-off events. [2025-04-14 00:10:35,812 INFO L117 PetriNetUnfolderBase]: For 1864/1864 co-relation queries the response was YES. [2025-04-14 00:10:35,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 2346 events. 1525/2346 cut-off events. For 1864/1864 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11155 event pairs, 121 based on Foata normal form. 8/2352 useless extension candidates. Maximal degree in co-relation 6076. Up to 1360 conditions per place. [2025-04-14 00:10:35,821 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 1 changer transitions 32/78 dead transitions. [2025-04-14 00:10:35,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 78 transitions, 488 flow [2025-04-14 00:10:35,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:10:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:10:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-04-14 00:10:35,823 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2025-04-14 00:10:35,823 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 154 flow. Second operand 5 states and 92 transitions. [2025-04-14 00:10:35,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 78 transitions, 488 flow [2025-04-14 00:10:35,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 363 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-04-14 00:10:35,831 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 107 flow [2025-04-14 00:10:35,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-04-14 00:10:35,831 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-04-14 00:10:35,831 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 107 flow [2025-04-14 00:10:35,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-14 00:10:35,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:35,832 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] [2025-04-14 00:10:35,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:10:35,832 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:35,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2086499160, now seen corresponding path program 2 times [2025-04-14 00:10:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:35,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679807040] [2025-04-14 00:10:35,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:10:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:35,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:10:35,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:35,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:10:35,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:39,101 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-14 00:10:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:39,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679807040] [2025-04-14 00:10:39,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679807040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:10:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921353052] [2025-04-14 00:10:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:39,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:10:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:39,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:10:39,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:10:39,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:39,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 107 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:39,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:39,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:39,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:39,916 INFO L116 PetriNetUnfolderBase]: 1842/2935 cut-off events. [2025-04-14 00:10:39,917 INFO L117 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-04-14 00:10:39,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 2935 events. 1842/2935 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14812 event pairs, 482 based on Foata normal form. 8/2940 useless extension candidates. Maximal degree in co-relation 6702. Up to 1390 conditions per place. [2025-04-14 00:10:39,931 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 62 selfloop transitions, 9 changer transitions 52/126 dead transitions. [2025-04-14 00:10:39,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 126 transitions, 611 flow [2025-04-14 00:10:39,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:10:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:10:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2025-04-14 00:10:39,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5015873015873016 [2025-04-14 00:10:39,934 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 107 flow. Second operand 9 states and 158 transitions. [2025-04-14 00:10:39,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 126 transitions, 611 flow [2025-04-14 00:10:39,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 126 transitions, 600 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:39,938 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 162 flow [2025-04-14 00:10:39,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-04-14 00:10:39,938 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2025-04-14 00:10:39,939 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 162 flow [2025-04-14 00:10:39,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:39,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:39,940 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] [2025-04-14 00:10:39,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:10:39,940 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:39,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:39,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1422733216, now seen corresponding path program 3 times [2025-04-14 00:10:39,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:39,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792347566] [2025-04-14 00:10:39,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:10:39,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:39,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:10:40,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:40,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:10:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:10:41,384 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-14 00:10:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:10:41,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792347566] [2025-04-14 00:10:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792347566] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:10:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:10:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:10:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905384491] [2025-04-14 00:10:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:10:41,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:10:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:10:41,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:10:41,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:10:41,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 00:10:41,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:41,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:10:41,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 00:10:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:10:41,862 INFO L116 PetriNetUnfolderBase]: 1968/3149 cut-off events. [2025-04-14 00:10:41,862 INFO L117 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2025-04-14 00:10:41,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8014 conditions, 3149 events. 1968/3149 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16285 event pairs, 992 based on Foata normal form. 8/3154 useless extension candidates. Maximal degree in co-relation 7996. Up to 1761 conditions per place. [2025-04-14 00:10:41,876 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 7 changer transitions 36/111 dead transitions. [2025-04-14 00:10:41,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 607 flow [2025-04-14 00:10:41,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:10:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:10:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2025-04-14 00:10:41,877 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2025-04-14 00:10:41,877 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 162 flow. Second operand 8 states and 129 transitions. [2025-04-14 00:10:41,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 607 flow [2025-04-14 00:10:41,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 595 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 00:10:41,881 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 195 flow [2025-04-14 00:10:41,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-04-14 00:10:41,883 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-04-14 00:10:41,883 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 195 flow [2025-04-14 00:10:41,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:10:41,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:41,883 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] [2025-04-14 00:10:41,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:10:41,883 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:41,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1943664130, now seen corresponding path program 4 times [2025-04-14 00:10:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:41,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511239635] [2025-04-14 00:10:41,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:10:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:10:41,904 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:10:41,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:41,989 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:10:41,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:10:41,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:10:41,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:10:42,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:10:42,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:10:42,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:10:42,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:10:42,110 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:10:42,111 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:10:42,114 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:10:42,114 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:10:42,114 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:10:42,114 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:10:42,114 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:10:42,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:10:42,115 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-04-14 00:10:42,222 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:10:42,222 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:10:42,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:10:42 BasicIcfg [2025-04-14 00:10:42,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:10:42,227 INFO L158 Benchmark]: Toolchain (without parser) took 13276.99ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 99.6MB in the beginning and 550.6MB in the end (delta: -451.0MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. [2025-04-14 00:10:42,227 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:42,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.13ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 70.8MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 00:10:42,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.04ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:10:42,229 INFO L158 Benchmark]: Boogie Preprocessor took 55.41ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 63.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:42,229 INFO L158 Benchmark]: IcfgBuilder took 1075.66ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 63.4MB in the end (delta: 299.2kB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:42,232 INFO L158 Benchmark]: TraceAbstraction took 11516.81ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 62.8MB in the beginning and 550.6MB in the end (delta: -487.8MB). Peak memory consumption was 74.2MB. Max. memory is 8.0GB. [2025-04-14 00:10:42,233 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.38ms. Allocated memory is still 155.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 577.13ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 70.8MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.04ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 55.41ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 63.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1075.66ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 63.4MB in the end (delta: 299.2kB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. * TraceAbstraction took 11516.81ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 62.8MB in the beginning and 550.6MB in the end (delta: -487.8MB). Peak memory consumption was 74.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2449; [L862] FCALL, FORK 0 pthread_create(&t2449, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2450; [L864] FCALL, FORK 0 pthread_create(&t2450, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, t2450=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 pthread_t t2451; [L866] FCALL, FORK 0 pthread_create(&t2451, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2449=-2, t2450=-1, t2451=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 x$flush_delayed = weak$$choice2 [L820] EXPR 3 \read(x) [L820] 3 x$mem_tmp = x [L821] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L822] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L822] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L822] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L822] EXPR 3 \read(x) [L822] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L822] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L822] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L822] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L822] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L823] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L824] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L825] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L826] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L828] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L829] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L830] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L831] EXPR 3 \read(x) [L831] 3 __unbuffered_p2_EAX = x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L832] 3 x = x$flush_delayed ? x$mem_tmp : x [L833] 3 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L836] 3 __unbuffered_p2_EBX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L803] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$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_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 \read(x) [L839] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L839] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L839] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L840] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L841] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L842] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L843] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L846] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L810] 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_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449=-2, t2450=-1, t2451=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 \read(x) [L872] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L873] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L874] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L875] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L876] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449=-2, t2450=-1, t2451=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L880] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L880] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L881] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2449=-2, t2450=-1, t2451=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 19]: 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: 866]: 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: 864]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 61 locations, 57 edges, 6 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: 11.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 433 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1279 IncrementalHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 0 mSDtfsCounter, 1279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=7, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 1481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-14 00:10:42,247 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...