/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:21:38,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:21:38,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:21:38,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:21:38,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:21:38,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:21:38,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:21:38,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:21:38,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:21:38,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:21:38,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:21:38,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:21:38,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:21:38,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:21:38,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:21:38,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:21:38,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:21:38,810 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:21:38,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:21:38,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:21:38,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:21:38,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:21:38,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:21:38,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:21:38,811 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 -> FINITE_AUTOMATA [2025-04-13 17:21:39,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:21:39,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:21:39,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:21:39,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:21:39,031 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:21:39,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2025-04-13 17:21:40,318 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a79c48c/fd54cb027078407dbd096c37e68ef872/FLAG47c4417c3 [2025-04-13 17:21:40,593 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:21:40,594 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.opt.i [2025-04-13 17:21:40,604 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a79c48c/fd54cb027078407dbd096c37e68ef872/FLAG47c4417c3 [2025-04-13 17:21:41,520 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58a79c48c/fd54cb027078407dbd096c37e68ef872 [2025-04-13 17:21:41,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:21:41,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:21:41,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:21:41,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:21:41,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:21:41,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:21:41" (1/1) ... [2025-04-13 17:21:41,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7139437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:41, skipping insertion in model container [2025-04-13 17:21:41,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:21:41" (1/1) ... [2025-04-13 17:21:41,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:21:41,719 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/safe000_power.opt.i[951,964] [2025-04-13 17:21:41,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:21:41,925 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:21:41,948 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/safe000_power.opt.i[951,964] [2025-04-13 17:21:42,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:21:42,041 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:21:42,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42 WrapperNode [2025-04-13 17:21:42,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:21:42,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:21:42,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:21:42,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:21:42,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,088 INFO L138 Inliner]: procedures = 175, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2025-04-13 17:21:42,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:21:42,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:21:42,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:21:42,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:21:42,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,128 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 6 writes are split as follows [0, 6]. [2025-04-13 17:21:42,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:21:42,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:21:42,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:21:42,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:21:42,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (1/1) ... [2025-04-13 17:21:42,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:21:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:21:42,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 17:21:42,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 17:21:42,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 17:21:42,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 17:21:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 17:21:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 17:21:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 17:21:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:21:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:21:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:21:42,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:21:42,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:21:42,194 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:21:42,310 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:21:42,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:21:42,668 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:21:42,669 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:21:42,669 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:21:42,999 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:21:42,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:21:42 BoogieIcfgContainer [2025-04-13 17:21:42,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:21:43,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:21:43,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:21:43,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:21:43,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:21:41" (1/3) ... [2025-04-13 17:21:43,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a09d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:21:43, skipping insertion in model container [2025-04-13 17:21:43,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:21:42" (2/3) ... [2025-04-13 17:21:43,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a09d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:21:43, skipping insertion in model container [2025-04-13 17:21:43,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:21:42" (3/3) ... [2025-04-13 17:21:43,005 INFO L128 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2025-04-13 17:21:43,017 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:21:43,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe000_power.opt.i that has 4 procedures, 36 locations, 32 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 17:21:43,019 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:21:43,080 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:21:43,103 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 35 transitions, 82 flow [2025-04-13 17:21:43,249 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3070 states, 3067 states have (on average 3.415063580045647) internal successors, (10474), 3069 states have internal predecessors, (10474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:43,269 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:21:43,279 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=FINITE_AUTOMATA, 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;@371de4de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:21:43,279 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:21:43,287 INFO L278 IsEmpty]: Start isEmpty. Operand has 3070 states, 3067 states have (on average 3.415063580045647) internal successors, (10474), 3069 states have internal predecessors, (10474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:43,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-13 17:21:43,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:43,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 17:21:43,292 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:43,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 673594381, now seen corresponding path program 1 times [2025-04-13 17:21:43,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:43,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016706512] [2025-04-13 17:21:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:43,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 17:21:43,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 17:21:43,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:43,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:43,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:43,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016706512] [2025-04-13 17:21:43,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016706512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:43,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:43,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 17:21:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415005421] [2025-04-13 17:21:43,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:43,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:21:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:43,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:21:43,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:21:43,695 INFO L87 Difference]: Start difference. First operand has 3070 states, 3067 states have (on average 3.415063580045647) internal successors, (10474), 3069 states have internal predecessors, (10474), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:43,854 INFO L93 Difference]: Finished difference Result 3070 states and 10474 transitions. [2025-04-13 17:21:43,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:21:43,857 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-04-13 17:21:43,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:43,891 INFO L225 Difference]: With dead ends: 3070 [2025-04-13 17:21:43,892 INFO L226 Difference]: Without dead ends: 2515 [2025-04-13 17:21:43,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:21:43,898 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:43,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 20 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2025-04-13 17:21:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 2515. [2025-04-13 17:21:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 8526 transitions. [2025-04-13 17:21:44,035 INFO L79 Accepts]: Start accepts. Automaton has 2515 states and 8526 transitions. Word has length 5 [2025-04-13 17:21:44,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:44,036 INFO L485 AbstractCegarLoop]: Abstraction has 2515 states and 8526 transitions. [2025-04-13 17:21:44,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:44,036 INFO L278 IsEmpty]: Start isEmpty. Operand 2515 states and 8526 transitions. [2025-04-13 17:21:44,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:21:44,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:44,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:44,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:21:44,040 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:44,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1081907650, now seen corresponding path program 1 times [2025-04-13 17:21:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:44,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120664969] [2025-04-13 17:21:44,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:44,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:21:44,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:21:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:44,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120664969] [2025-04-13 17:21:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120664969] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:44,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:21:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683271905] [2025-04-13 17:21:44,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:44,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:21:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:44,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:21:44,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:21:44,355 INFO L87 Difference]: Start difference. First operand 2515 states and 8526 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:44,521 INFO L93 Difference]: Finished difference Result 3075 states and 10210 transitions. [2025-04-13 17:21:44,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:21:44,522 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 12 [2025-04-13 17:21:44,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:44,540 INFO L225 Difference]: With dead ends: 3075 [2025-04-13 17:21:44,541 INFO L226 Difference]: Without dead ends: 2389 [2025-04-13 17:21:44,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:44,545 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:44,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 39 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-04-13 17:21:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2389. [2025-04-13 17:21:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2388 states have (on average 3.3668341708542715) internal successors, (8040), 2388 states have internal predecessors, (8040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 8040 transitions. [2025-04-13 17:21:44,633 INFO L79 Accepts]: Start accepts. Automaton has 2389 states and 8040 transitions. Word has length 12 [2025-04-13 17:21:44,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:44,633 INFO L485 AbstractCegarLoop]: Abstraction has 2389 states and 8040 transitions. [2025-04-13 17:21:44,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:44,634 INFO L278 IsEmpty]: Start isEmpty. Operand 2389 states and 8040 transitions. [2025-04-13 17:21:44,639 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:21:44,639 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:44,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:44,639 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:21:44,640 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:44,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1070236032, now seen corresponding path program 1 times [2025-04-13 17:21:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:44,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630565172] [2025-04-13 17:21:44,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:44,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:21:44,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:21:44,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:44,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:44,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630565172] [2025-04-13 17:21:44,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630565172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:44,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:44,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:21:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760095929] [2025-04-13 17:21:44,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:44,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:21:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:44,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:21:44,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:44,877 INFO L87 Difference]: Start difference. First operand 2389 states and 8040 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:45,061 INFO L93 Difference]: Finished difference Result 3509 states and 11716 transitions. [2025-04-13 17:21:45,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:21:45,061 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 17:21:45,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:45,074 INFO L225 Difference]: With dead ends: 3509 [2025-04-13 17:21:45,074 INFO L226 Difference]: Without dead ends: 1584 [2025-04-13 17:21:45,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:21:45,078 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:45,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-04-13 17:21:45,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2025-04-13 17:21:45,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 3.228048010107391) internal successors, (5110), 1583 states have internal predecessors, (5110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 5110 transitions. [2025-04-13 17:21:45,132 INFO L79 Accepts]: Start accepts. Automaton has 1584 states and 5110 transitions. Word has length 15 [2025-04-13 17:21:45,132 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:45,132 INFO L485 AbstractCegarLoop]: Abstraction has 1584 states and 5110 transitions. [2025-04-13 17:21:45,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,133 INFO L278 IsEmpty]: Start isEmpty. Operand 1584 states and 5110 transitions. [2025-04-13 17:21:45,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 17:21:45,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:45,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:45,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:21:45,136 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:45,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1374273275, now seen corresponding path program 1 times [2025-04-13 17:21:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:45,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578390412] [2025-04-13 17:21:45,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 17:21:45,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 17:21:45,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:45,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578390412] [2025-04-13 17:21:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578390412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:21:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335632950] [2025-04-13 17:21:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:45,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:21:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:45,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:21:45,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:21:45,378 INFO L87 Difference]: Start difference. First operand 1584 states and 5110 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:45,481 INFO L93 Difference]: Finished difference Result 1784 states and 5680 transitions. [2025-04-13 17:21:45,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:21:45,482 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2025-04-13 17:21:45,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:45,491 INFO L225 Difference]: With dead ends: 1784 [2025-04-13 17:21:45,491 INFO L226 Difference]: Without dead ends: 1504 [2025-04-13 17:21:45,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:45,494 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:45,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 41 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2025-04-13 17:21:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2025-04-13 17:21:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 3.210911510312708) internal successors, (4826), 1503 states have internal predecessors, (4826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 4826 transitions. [2025-04-13 17:21:45,528 INFO L79 Accepts]: Start accepts. Automaton has 1504 states and 4826 transitions. Word has length 17 [2025-04-13 17:21:45,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:45,529 INFO L485 AbstractCegarLoop]: Abstraction has 1504 states and 4826 transitions. [2025-04-13 17:21:45,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,529 INFO L278 IsEmpty]: Start isEmpty. Operand 1504 states and 4826 transitions. [2025-04-13 17:21:45,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:21:45,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:45,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:45,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:21:45,534 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:45,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 868886756, now seen corresponding path program 1 times [2025-04-13 17:21:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:45,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954407048] [2025-04-13 17:21:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:45,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:21:45,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:21:45,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:45,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954407048] [2025-04-13 17:21:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954407048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:45,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:21:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078853580] [2025-04-13 17:21:45,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:45,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:21:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:45,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:21:45,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:21:45,751 INFO L87 Difference]: Start difference. First operand 1504 states and 4826 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:45,866 INFO L93 Difference]: Finished difference Result 1664 states and 5274 transitions. [2025-04-13 17:21:45,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:21:45,867 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) Word has length 19 [2025-04-13 17:21:45,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:45,876 INFO L225 Difference]: With dead ends: 1664 [2025-04-13 17:21:45,877 INFO L226 Difference]: Without dead ends: 1464 [2025-04-13 17:21:45,877 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:45,878 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:45,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 42 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-04-13 17:21:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2025-04-13 17:21:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 3.2016404647983596) internal successors, (4684), 1463 states have internal predecessors, (4684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 4684 transitions. [2025-04-13 17:21:45,910 INFO L79 Accepts]: Start accepts. Automaton has 1464 states and 4684 transitions. Word has length 19 [2025-04-13 17:21:45,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:45,910 INFO L485 AbstractCegarLoop]: Abstraction has 1464 states and 4684 transitions. [2025-04-13 17:21:45,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:45,910 INFO L278 IsEmpty]: Start isEmpty. Operand 1464 states and 4684 transitions. [2025-04-13 17:21:45,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:21:45,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:45,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:45,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:21:45,916 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:45,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1165716385, now seen corresponding path program 1 times [2025-04-13 17:21:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:45,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692844724] [2025-04-13 17:21:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:45,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:21:45,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:21:45,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:45,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:46,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692844724] [2025-04-13 17:21:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692844724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:21:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617683237] [2025-04-13 17:21:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:46,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:21:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:46,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:21:46,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:46,126 INFO L87 Difference]: Start difference. First operand 1464 states and 4684 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:46,237 INFO L93 Difference]: Finished difference Result 2364 states and 7559 transitions. [2025-04-13 17:21:46,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:21:46,237 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2025-04-13 17:21:46,238 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:46,246 INFO L225 Difference]: With dead ends: 2364 [2025-04-13 17:21:46,246 INFO L226 Difference]: Without dead ends: 1274 [2025-04-13 17:21:46,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:21:46,249 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:46,249 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-04-13 17:21:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2025-04-13 17:21:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 3.204241948153967) internal successors, (4079), 1273 states have internal predecessors, (4079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 4079 transitions. [2025-04-13 17:21:46,275 INFO L79 Accepts]: Start accepts. Automaton has 1274 states and 4079 transitions. Word has length 20 [2025-04-13 17:21:46,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:46,275 INFO L485 AbstractCegarLoop]: Abstraction has 1274 states and 4079 transitions. [2025-04-13 17:21:46,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:46,275 INFO L278 IsEmpty]: Start isEmpty. Operand 1274 states and 4079 transitions. [2025-04-13 17:21:46,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 17:21:46,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:46,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:46,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:21:46,277 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:46,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash 850861095, now seen corresponding path program 2 times [2025-04-13 17:21:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:46,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018248918] [2025-04-13 17:21:46,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:21:46,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:46,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 17:21:46,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 17:21:46,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:21:46,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:47,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:47,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018248918] [2025-04-13 17:21:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018248918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:47,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:47,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:21:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057786106] [2025-04-13 17:21:47,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:47,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:21:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:21:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:21:47,488 INFO L87 Difference]: Start difference. First operand 1274 states and 4079 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:47,702 INFO L93 Difference]: Finished difference Result 1547 states and 4928 transitions. [2025-04-13 17:21:47,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:21:47,702 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) Word has length 20 [2025-04-13 17:21:47,702 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:47,710 INFO L225 Difference]: With dead ends: 1547 [2025-04-13 17:21:47,711 INFO L226 Difference]: Without dead ends: 1372 [2025-04-13 17:21:47,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:21:47,712 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:47,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 53 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:21:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-04-13 17:21:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1270. [2025-04-13 17:21:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1269 states have (on average 3.1836091410559497) internal successors, (4040), 1269 states have internal predecessors, (4040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 4040 transitions. [2025-04-13 17:21:47,740 INFO L79 Accepts]: Start accepts. Automaton has 1270 states and 4040 transitions. Word has length 20 [2025-04-13 17:21:47,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:47,740 INFO L485 AbstractCegarLoop]: Abstraction has 1270 states and 4040 transitions. [2025-04-13 17:21:47,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:47,740 INFO L278 IsEmpty]: Start isEmpty. Operand 1270 states and 4040 transitions. [2025-04-13 17:21:47,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 17:21:47,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:47,742 INFO L218 NwaCegarLoop]: 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-13 17:21:47,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:21:47,744 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:47,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1261772068, now seen corresponding path program 1 times [2025-04-13 17:21:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:47,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286245546] [2025-04-13 17:21:47,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:47,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 17:21:47,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 17:21:47,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:47,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:48,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:48,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286245546] [2025-04-13 17:21:48,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286245546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:48,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:48,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:21:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994881799] [2025-04-13 17:21:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:48,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:21:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:48,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:21:48,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:21:48,354 INFO L87 Difference]: Start difference. First operand 1270 states and 4040 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:48,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:48,585 INFO L93 Difference]: Finished difference Result 1396 states and 4385 transitions. [2025-04-13 17:21:48,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:48,585 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 21 [2025-04-13 17:21:48,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:48,596 INFO L225 Difference]: With dead ends: 1396 [2025-04-13 17:21:48,596 INFO L226 Difference]: Without dead ends: 1268 [2025-04-13 17:21:48,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:21:48,598 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:48,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 92 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:21:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-04-13 17:21:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1264. [2025-04-13 17:21:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 3.182897862232779) internal successors, (4020), 1263 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 4020 transitions. [2025-04-13 17:21:48,621 INFO L79 Accepts]: Start accepts. Automaton has 1264 states and 4020 transitions. Word has length 21 [2025-04-13 17:21:48,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:48,621 INFO L485 AbstractCegarLoop]: Abstraction has 1264 states and 4020 transitions. [2025-04-13 17:21:48,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:48,621 INFO L278 IsEmpty]: Start isEmpty. Operand 1264 states and 4020 transitions. [2025-04-13 17:21:48,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:21:48,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:48,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:48,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:21:48,634 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:48,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:48,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1634346958, now seen corresponding path program 1 times [2025-04-13 17:21:48,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:48,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591804522] [2025-04-13 17:21:48,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:48,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:21:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:21:48,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:48,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:50,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591804522] [2025-04-13 17:21:50,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591804522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:21:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90749747] [2025-04-13 17:21:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:50,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:21:50,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:50,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:21:50,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:21:50,036 INFO L87 Difference]: Start difference. First operand 1264 states and 4020 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:50,267 INFO L93 Difference]: Finished difference Result 1442 states and 4547 transitions. [2025-04-13 17:21:50,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:50,268 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) Word has length 22 [2025-04-13 17:21:50,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:50,276 INFO L225 Difference]: With dead ends: 1442 [2025-04-13 17:21:50,276 INFO L226 Difference]: Without dead ends: 1337 [2025-04-13 17:21:50,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:21:50,277 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:50,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 98 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:21:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2025-04-13 17:21:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1268. [2025-04-13 17:21:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 3.18232044198895) internal successors, (4032), 1267 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 4032 transitions. [2025-04-13 17:21:50,300 INFO L79 Accepts]: Start accepts. Automaton has 1268 states and 4032 transitions. Word has length 22 [2025-04-13 17:21:50,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:50,301 INFO L485 AbstractCegarLoop]: Abstraction has 1268 states and 4032 transitions. [2025-04-13 17:21:50,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:50,301 INFO L278 IsEmpty]: Start isEmpty. Operand 1268 states and 4032 transitions. [2025-04-13 17:21:50,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:21:50,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:50,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:50,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:21:50,303 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:50,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:50,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1634352724, now seen corresponding path program 1 times [2025-04-13 17:21:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:50,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161957253] [2025-04-13 17:21:50,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:50,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:50,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:21:50,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:21:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:51,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:51,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161957253] [2025-04-13 17:21:51,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161957253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:51,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:51,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:21:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631553417] [2025-04-13 17:21:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:51,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:21:51,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:51,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:21:51,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:21:51,293 INFO L87 Difference]: Start difference. First operand 1268 states and 4032 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:51,515 INFO L93 Difference]: Finished difference Result 1496 states and 4724 transitions. [2025-04-13 17:21:51,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:51,517 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) Word has length 22 [2025-04-13 17:21:51,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:51,527 INFO L225 Difference]: With dead ends: 1496 [2025-04-13 17:21:51,527 INFO L226 Difference]: Without dead ends: 1391 [2025-04-13 17:21:51,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:21:51,528 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 56 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:51,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 96 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:21:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2025-04-13 17:21:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1283. [2025-04-13 17:21:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 3.1762870514820594) internal successors, (4072), 1282 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 4072 transitions. [2025-04-13 17:21:51,551 INFO L79 Accepts]: Start accepts. Automaton has 1283 states and 4072 transitions. Word has length 22 [2025-04-13 17:21:51,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:51,551 INFO L485 AbstractCegarLoop]: Abstraction has 1283 states and 4072 transitions. [2025-04-13 17:21:51,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:51,551 INFO L278 IsEmpty]: Start isEmpty. Operand 1283 states and 4072 transitions. [2025-04-13 17:21:51,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:21:51,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:51,553 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:51,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:21:51,553 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:51,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1634341192, now seen corresponding path program 1 times [2025-04-13 17:21:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:51,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463683400] [2025-04-13 17:21:51,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:51,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:51,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 17:21:51,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:21:51,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:51,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:51,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463683400] [2025-04-13 17:21:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463683400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:21:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021028779] [2025-04-13 17:21:51,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:51,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:21:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:51,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:21:51,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:21:51,670 INFO L87 Difference]: Start difference. First operand 1283 states and 4072 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:51,747 INFO L93 Difference]: Finished difference Result 1851 states and 5758 transitions. [2025-04-13 17:21:51,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:21:51,748 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) Word has length 22 [2025-04-13 17:21:51,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:51,753 INFO L225 Difference]: With dead ends: 1851 [2025-04-13 17:21:51,753 INFO L226 Difference]: Without dead ends: 1058 [2025-04-13 17:21:51,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:51,756 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:51,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 20 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-04-13 17:21:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2025-04-13 17:21:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1057 states have (on average 3.063386944181646) internal successors, (3238), 1057 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 3238 transitions. [2025-04-13 17:21:51,775 INFO L79 Accepts]: Start accepts. Automaton has 1058 states and 3238 transitions. Word has length 22 [2025-04-13 17:21:51,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:51,775 INFO L485 AbstractCegarLoop]: Abstraction has 1058 states and 3238 transitions. [2025-04-13 17:21:51,775 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:51,775 INFO L278 IsEmpty]: Start isEmpty. Operand 1058 states and 3238 transitions. [2025-04-13 17:21:51,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:21:51,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:51,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:51,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:21:51,778 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:51,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash -981121889, now seen corresponding path program 1 times [2025-04-13 17:21:51,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:51,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754284710] [2025-04-13 17:21:51,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:51,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:51,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:21:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:21:51,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:51,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:52,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:52,415 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754284710] [2025-04-13 17:21:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754284710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:21:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254699728] [2025-04-13 17:21:52,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:52,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:21:52,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:52,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:21:52,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:21:52,416 INFO L87 Difference]: Start difference. First operand 1058 states and 3238 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 17:21:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:52,596 INFO L93 Difference]: Finished difference Result 1278 states and 3887 transitions. [2025-04-13 17:21:52,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:52,596 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 23 [2025-04-13 17:21:52,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:52,602 INFO L225 Difference]: With dead ends: 1278 [2025-04-13 17:21:52,602 INFO L226 Difference]: Without dead ends: 1174 [2025-04-13 17:21:52,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:21:52,603 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 72 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:52,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 67 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:52,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-04-13 17:21:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1158. [2025-04-13 17:21:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 3.0812445980985306) internal successors, (3565), 1157 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 3565 transitions. [2025-04-13 17:21:52,629 INFO L79 Accepts]: Start accepts. Automaton has 1158 states and 3565 transitions. Word has length 23 [2025-04-13 17:21:52,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:52,630 INFO L485 AbstractCegarLoop]: Abstraction has 1158 states and 3565 transitions. [2025-04-13 17:21:52,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 17:21:52,630 INFO L278 IsEmpty]: Start isEmpty. Operand 1158 states and 3565 transitions. [2025-04-13 17:21:52,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:21:52,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:52,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:52,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:21:52,633 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:52,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1068125343, now seen corresponding path program 2 times [2025-04-13 17:21:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:52,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133191856] [2025-04-13 17:21:52,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:21:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:52,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:21:52,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:21:52,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:21:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:53,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133191856] [2025-04-13 17:21:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133191856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:53,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:21:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83791421] [2025-04-13 17:21:53,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:53,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:21:53,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:53,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:21:53,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:21:53,685 INFO L87 Difference]: Start difference. First operand 1158 states and 3565 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 17:21:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:53,865 INFO L93 Difference]: Finished difference Result 1218 states and 3713 transitions. [2025-04-13 17:21:53,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:53,866 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 23 [2025-04-13 17:21:53,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:53,871 INFO L225 Difference]: With dead ends: 1218 [2025-04-13 17:21:53,871 INFO L226 Difference]: Without dead ends: 1154 [2025-04-13 17:21:53,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:21:53,872 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:53,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 89 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-04-13 17:21:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1100. [2025-04-13 17:21:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 3.0709736123748863) internal successors, (3375), 1099 states have internal predecessors, (3375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 3375 transitions. [2025-04-13 17:21:53,891 INFO L79 Accepts]: Start accepts. Automaton has 1100 states and 3375 transitions. Word has length 23 [2025-04-13 17:21:53,891 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:53,891 INFO L485 AbstractCegarLoop]: Abstraction has 1100 states and 3375 transitions. [2025-04-13 17:21:53,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 17:21:53,891 INFO L278 IsEmpty]: Start isEmpty. Operand 1100 states and 3375 transitions. [2025-04-13 17:21:53,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:21:53,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:53,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:53,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:21:53,894 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:53,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2025012257, now seen corresponding path program 1 times [2025-04-13 17:21:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:53,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623575840] [2025-04-13 17:21:53,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:53,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:21:53,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:21:53,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:53,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:54,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623575840] [2025-04-13 17:21:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623575840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 17:21:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193696120] [2025-04-13 17:21:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:54,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:21:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:21:54,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:21:54,523 INFO L87 Difference]: Start difference. First operand 1100 states and 3375 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 17:21:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:54,687 INFO L93 Difference]: Finished difference Result 1160 states and 3523 transitions. [2025-04-13 17:21:54,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:54,688 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 23 [2025-04-13 17:21:54,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:54,692 INFO L225 Difference]: With dead ends: 1160 [2025-04-13 17:21:54,693 INFO L226 Difference]: Without dead ends: 1096 [2025-04-13 17:21:54,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:21:54,693 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:54,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 90 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2025-04-13 17:21:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1084. [2025-04-13 17:21:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 3.0664819944598336) internal successors, (3321), 1083 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 3321 transitions. [2025-04-13 17:21:54,711 INFO L79 Accepts]: Start accepts. Automaton has 1084 states and 3321 transitions. Word has length 23 [2025-04-13 17:21:54,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:54,711 INFO L485 AbstractCegarLoop]: Abstraction has 1084 states and 3321 transitions. [2025-04-13 17:21:54,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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-13 17:21:54,711 INFO L278 IsEmpty]: Start isEmpty. Operand 1084 states and 3321 transitions. [2025-04-13 17:21:54,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 17:21:54,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:54,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:54,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:21:54,714 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:54,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash -133704353, now seen corresponding path program 1 times [2025-04-13 17:21:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:54,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487098335] [2025-04-13 17:21:54,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:54,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 17:21:54,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 17:21:54,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:54,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:54,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:54,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487098335] [2025-04-13 17:21:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487098335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:54,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:54,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:21:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84557945] [2025-04-13 17:21:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:54,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:21:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:54,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:21:54,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:21:54,843 INFO L87 Difference]: Start difference. First operand 1084 states and 3321 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 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-13 17:21:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:54,953 INFO L93 Difference]: Finished difference Result 1328 states and 3973 transitions. [2025-04-13 17:21:54,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:21:54,954 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 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) Word has length 23 [2025-04-13 17:21:54,954 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:54,958 INFO L225 Difference]: With dead ends: 1328 [2025-04-13 17:21:54,958 INFO L226 Difference]: Without dead ends: 752 [2025-04-13 17:21:54,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:21:54,960 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 75 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:54,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 25 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-04-13 17:21:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2025-04-13 17:21:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 751 states have (on average 2.88814913448735) internal successors, (2169), 751 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 2169 transitions. [2025-04-13 17:21:54,973 INFO L79 Accepts]: Start accepts. Automaton has 752 states and 2169 transitions. Word has length 23 [2025-04-13 17:21:54,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:54,973 INFO L485 AbstractCegarLoop]: Abstraction has 752 states and 2169 transitions. [2025-04-13 17:21:54,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 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-13 17:21:54,973 INFO L278 IsEmpty]: Start isEmpty. Operand 752 states and 2169 transitions. [2025-04-13 17:21:54,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:21:54,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:54,974 INFO L218 NwaCegarLoop]: 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] [2025-04-13 17:21:54,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:21:54,975 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:54,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1131844222, now seen corresponding path program 1 times [2025-04-13 17:21:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:54,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361504394] [2025-04-13 17:21:54,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:54,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:21:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:21:54,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:55,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361504394] [2025-04-13 17:21:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361504394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:21:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795806635] [2025-04-13 17:21:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:55,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:21:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:55,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:21:55,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:21:55,811 INFO L87 Difference]: Start difference. First operand 752 states and 2169 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:56,035 INFO L93 Difference]: Finished difference Result 844 states and 2424 transitions. [2025-04-13 17:21:56,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:21:56,035 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) Word has length 25 [2025-04-13 17:21:56,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:56,039 INFO L225 Difference]: With dead ends: 844 [2025-04-13 17:21:56,039 INFO L226 Difference]: Without dead ends: 812 [2025-04-13 17:21:56,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:21:56,040 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:56,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 112 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:21:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-04-13 17:21:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 782. [2025-04-13 17:21:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 2.8950064020486557) internal successors, (2261), 781 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2261 transitions. [2025-04-13 17:21:56,053 INFO L79 Accepts]: Start accepts. Automaton has 782 states and 2261 transitions. Word has length 25 [2025-04-13 17:21:56,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:56,053 INFO L485 AbstractCegarLoop]: Abstraction has 782 states and 2261 transitions. [2025-04-13 17:21:56,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:56,053 INFO L278 IsEmpty]: Start isEmpty. Operand 782 states and 2261 transitions. [2025-04-13 17:21:56,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:21:56,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:56,055 INFO L218 NwaCegarLoop]: 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] [2025-04-13 17:21:56,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:21:56,055 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:56,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1271815170, now seen corresponding path program 1 times [2025-04-13 17:21:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:56,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980703750] [2025-04-13 17:21:56,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:56,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:21:56,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:21:56,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:56,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:21:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:21:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:21:56,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980703750] [2025-04-13 17:21:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980703750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:21:56,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:21:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:21:56,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172264145] [2025-04-13 17:21:56,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:21:56,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:21:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:21:56,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:21:56,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:21:56,191 INFO L87 Difference]: Start difference. First operand 782 states and 2261 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:21:56,288 INFO L93 Difference]: Finished difference Result 822 states and 2353 transitions. [2025-04-13 17:21:56,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:21:56,288 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 25 [2025-04-13 17:21:56,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:21:56,292 INFO L225 Difference]: With dead ends: 822 [2025-04-13 17:21:56,292 INFO L226 Difference]: Without dead ends: 578 [2025-04-13 17:21:56,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:21:56,293 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:21:56,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 17 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:21:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-04-13 17:21:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 530. [2025-04-13 17:21:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.846880907372401) internal successors, (1506), 529 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1506 transitions. [2025-04-13 17:21:56,302 INFO L79 Accepts]: Start accepts. Automaton has 530 states and 1506 transitions. Word has length 25 [2025-04-13 17:21:56,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:21:56,302 INFO L485 AbstractCegarLoop]: Abstraction has 530 states and 1506 transitions. [2025-04-13 17:21:56,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:21:56,302 INFO L278 IsEmpty]: Start isEmpty. Operand 530 states and 1506 transitions. [2025-04-13 17:21:56,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:21:56,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:21:56,304 INFO L218 NwaCegarLoop]: 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-13 17:21:56,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:21:56,304 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 17:21:56,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:21:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -128893411, now seen corresponding path program 1 times [2025-04-13 17:21:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:21:56,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231776241] [2025-04-13 17:21:56,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:21:56,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:21:56,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:21:56,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:21:56,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:56,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:21:56,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:21:56,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:21:56,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:21:56,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:21:56,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:21:56,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:21:56,465 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:21:56,465 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 17:21:56,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:21:56,466 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 17:21:56,467 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 17:21:56,467 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 17:21:56,467 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:21:56,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 17:21:56,468 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:21:56,582 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:21:56,582 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:21:56,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:21:56 BasicIcfg [2025-04-13 17:21:56,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:21:56,585 INFO L158 Benchmark]: Toolchain (without parser) took 15062.56ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 99.9MB in the beginning and 361.3MB in the end (delta: -261.4MB). Peak memory consumption was 284.3MB. Max. memory is 8.0GB. [2025-04-13 17:21:56,586 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:21:56,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.52ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 71.8MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 17:21:56,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.27ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:21:56,586 INFO L158 Benchmark]: Boogie Preprocessor took 55.94ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 65.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:21:56,586 INFO L158 Benchmark]: RCFGBuilder took 852.06ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 75.8MB in the end (delta: -10.6MB). Peak memory consumption was 49.4MB. Max. memory is 8.0GB. [2025-04-13 17:21:56,587 INFO L158 Benchmark]: TraceAbstraction took 13584.73ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 74.9MB in the beginning and 361.3MB in the end (delta: -286.4MB). Peak memory consumption was 260.4MB. Max. memory is 8.0GB. [2025-04-13 17:21:56,588 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 520.52ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 71.8MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.27ms. Allocated memory is still 142.6MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 55.94ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 65.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 852.06ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 75.8MB in the end (delta: -10.6MB). Peak memory consumption was 49.4MB. Max. memory is 8.0GB. * TraceAbstraction took 13584.73ms. Allocated memory was 142.6MB in the beginning and 687.9MB in the end (delta: 545.3MB). Free memory was 74.9MB in the beginning and 361.3MB in the end (delta: -286.4MB). Peak memory consumption was 260.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=-3, 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] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=-3, t1781=-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] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1780=-3, t1781=-2, t1782=-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] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 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_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 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_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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] [L808] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=1] [L811] 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) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] 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) [L811] 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) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 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 [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=1] [L825] 3 __unbuffered_p2_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=1] [L828] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=2] [L831] 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) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] 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) [L831] 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) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 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 [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=2] [L760] 1 __unbuffered_p0_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=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=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=-3, t1781=-2, t1782=-1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] 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) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=-3, t1781=-2, t1782=-1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780=-3, t1781=-2, t1782=-1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 858]: 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: 856]: 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. OverallTime: 13.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 994 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 717 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1891 IncrementalHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 277 mSDtfsCounter, 1891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3070occurred in iteration=0, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 443 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 364 NumberOfCodeBlocks, 364 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 4273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 17:21:56,602 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...