/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 -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --traceabstraction.refinement.strategy.for.commutativity.condition.synthesis CAMEL -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 21:37:20,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 21:37:20,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 21:37:20,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 21:37:20,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 21:37:20,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 21:37:20,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 21:37:20,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 21:37:20,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 21:37:20,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 21:37:20,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 21:37:20,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 21:37:20,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 21:37:20,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 21:37:20,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 21:37:20,304 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 21:37:20,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 21:37:20,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Refinement strategy for commutativity condition synthesis -> CAMEL [2024-11-14 21:37:20,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 21:37:20,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 21:37:20,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 21:37:20,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 21:37:20,539 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 21:37:20,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-theta/unwind2-100.i [2024-11-14 21:37:21,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 21:37:21,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 21:37:21,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i [2024-11-14 21:37:21,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/650d297cb/9a8193e8d79741638f9e0cbfeb3b102c/FLAG41bccad26 [2024-11-14 21:37:22,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/650d297cb/9a8193e8d79741638f9e0cbfeb3b102c [2024-11-14 21:37:22,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 21:37:22,290 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 21:37:22,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 21:37:22,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 21:37:22,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 21:37:22,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ccdc580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22, skipping insertion in model container [2024-11-14 21:37:22,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 21:37:22,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2024-11-14 21:37:22,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 21:37:22,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 21:37:22,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind2-100.i[33026,33039] [2024-11-14 21:37:22,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 21:37:22,647 INFO L204 MainTranslator]: Completed translation [2024-11-14 21:37:22,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22 WrapperNode [2024-11-14 21:37:22,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 21:37:22,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 21:37:22,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 21:37:22,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 21:37:22,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,686 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2024-11-14 21:37:22,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 21:37:22,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 21:37:22,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 21:37:22,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 21:37:22,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 21:37:22,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 21:37:22,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 21:37:22,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 21:37:22,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (1/1) ... [2024-11-14 21:37:22,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 21:37:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:22,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 21:37:22,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 21:37:22,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 21:37:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-14 21:37:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-14 21:37:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-14 21:37:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-14 21:37:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 21:37:22,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 21:37:22,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 21:37:22,763 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 21:37:22,868 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 21:37:22,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 21:37:22,960 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 21:37:22,960 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 21:37:22,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 21:37:22,966 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 21:37:22,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 09:37:22 BoogieIcfgContainer [2024-11-14 21:37:22,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 21:37:22,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 21:37:22,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 21:37:22,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 21:37:22,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 09:37:22" (1/3) ... [2024-11-14 21:37:22,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efec6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 09:37:22, skipping insertion in model container [2024-11-14 21:37:22,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 09:37:22" (2/3) ... [2024-11-14 21:37:22,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efec6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 09:37:22, skipping insertion in model container [2024-11-14 21:37:22,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 09:37:22" (3/3) ... [2024-11-14 21:37:22,976 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind2-100.i [2024-11-14 21:37:22,999 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 21:37:23,000 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind2-100.i that has 3 procedures, 85 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-14 21:37:23,000 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 21:37:23,043 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 21:37:23,081 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 21:37:23,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 21:37:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:23,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 21:37:23,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 21:37:23,142 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 21:37:23,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2024-11-14 21:37:23,158 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@429480fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 21:37:23,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 21:37:23,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2057802001, now seen corresponding path program 1 times [2024-11-14 21:37:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:23,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686398394] [2024-11-14 21:37:23,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686398394] [2024-11-14 21:37:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686398394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 21:37:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 21:37:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 21:37:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193629252] [2024-11-14 21:37:23,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 21:37:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 21:37:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:23,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 21:37:23,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 21:37:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,462 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:23,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:23,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 21:37:23,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:23,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1530205675, now seen corresponding path program 1 times [2024-11-14 21:37:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:23,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019802136] [2024-11-14 21:37:23,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:23,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019802136] [2024-11-14 21:37:23,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019802136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 21:37:23,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 21:37:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 21:37:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082725004] [2024-11-14 21:37:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 21:37:23,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 21:37:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:23,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 21:37:23,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 21:37:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,755 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:23,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:23,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 21:37:23,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1053468063, now seen corresponding path program 1 times [2024-11-14 21:37:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:23,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905848343] [2024-11-14 21:37:23,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:24,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905848343] [2024-11-14 21:37:24,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905848343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638710536] [2024-11-14 21:37:24,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:24,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:24,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:24,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 21:37:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:24,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 21:37:24,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:24,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:37:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638710536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:37:24,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:37:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-14 21:37:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496313312] [2024-11-14 21:37:24,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:37:24,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 21:37:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:24,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 21:37:24,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-14 21:37:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:24,428 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:24,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:24,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:24,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 21:37:24,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 21:37:24,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:24,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1602314573, now seen corresponding path program 2 times [2024-11-14 21:37:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012044305] [2024-11-14 21:37:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:25,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012044305] [2024-11-14 21:37:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012044305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425564714] [2024-11-14 21:37:25,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 21:37:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:25,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:25,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 21:37:25,211 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 21:37:25,211 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:37:25,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 21:37:25,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-14 21:37:25,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 21:37:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425564714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 21:37:25,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 21:37:25,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-11-14 21:37:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400810795] [2024-11-14 21:37:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 21:37:25,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 21:37:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:25,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 21:37:25,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-14 21:37:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:25,362 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:25,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:25,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:25,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-11-14 21:37:25,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:25,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 21:37:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:25,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:25,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -461844729, now seen corresponding path program 2 times [2024-11-14 21:37:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309315510] [2024-11-14 21:37:25,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:26,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309315510] [2024-11-14 21:37:26,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309315510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 21:37:26,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 21:37:26,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 21:37:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971672189] [2024-11-14 21:37:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 21:37:26,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 21:37:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:26,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 21:37:26,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 21:37:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:26,107 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:26,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:26,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:26,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:26,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:26,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:26,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 21:37:26,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1660585839, now seen corresponding path program 3 times [2024-11-14 21:37:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418637135] [2024-11-14 21:37:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:26,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:26,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418637135] [2024-11-14 21:37:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418637135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:26,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824718653] [2024-11-14 21:37:26,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 21:37:26,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:26,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:26,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:26,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 21:37:26,525 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 21:37:26,525 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:37:26,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 21:37:26,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:26,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:37:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824718653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:37:26,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:37:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-14 21:37:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649415798] [2024-11-14 21:37:26,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:37:26,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 21:37:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:26,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 21:37:26,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-14 21:37:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:26,710 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:26,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:26,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:27,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 21:37:27,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:27,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:27,224 WARN L331 ript$VariableManager]: TermVariable v_~limit~0_Out_2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 21:37:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1865356945, now seen corresponding path program 1 times [2024-11-14 21:37:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45299370] [2024-11-14 21:37:27,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:37:27,235 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 21:37:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:37:27,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 21:37:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -479638107, now seen corresponding path program 4 times [2024-11-14 21:37:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990721701] [2024-11-14 21:37:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 21:37:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990721701] [2024-11-14 21:37:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990721701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137494623] [2024-11-14 21:37:27,487 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 21:37:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:27,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:27,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 21:37:27,544 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 21:37:27,545 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:37:27,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 21:37:27,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:27,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:37:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137494623] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:37:28,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:37:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 46 [2024-11-14 21:37:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473932064] [2024-11-14 21:37:28,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:37:28,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-14 21:37:28,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:28,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-14 21:37:28,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1816, Unknown=0, NotChecked=0, Total=2070 [2024-11-14 21:37:28,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:28,293 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:28,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.9347826086956523) internal successors, (135), 46 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:28,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:32,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:37:32,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 21:37:32,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:32,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:32,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1956371108, now seen corresponding path program 5 times [2024-11-14 21:37:32,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:32,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727931656] [2024-11-14 21:37:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727931656] [2024-11-14 21:37:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727931656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567717554] [2024-11-14 21:37:32,690 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 21:37:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:32,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:32,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:32,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 21:37:32,748 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-14 21:37:32,748 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:37:32,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 21:37:32,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:33,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:37:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567717554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:37:33,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:37:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 49 [2024-11-14 21:37:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232294532] [2024-11-14 21:37:33,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:37:33,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-14 21:37:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:33,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-14 21:37:33,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 21:37:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:33,350 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:33,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.673469387755102) internal successors, (229), 49 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:37:33,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:37:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:37:34,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 21:37:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:34,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:34,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash 514202417, now seen corresponding path program 6 times [2024-11-14 21:37:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969833513] [2024-11-14 21:37:34,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969833513] [2024-11-14 21:37:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969833513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016017237] [2024-11-14 21:37:35,430 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-14 21:37:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:35,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:35,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:35,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 21:37:35,499 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2024-11-14 21:37:35,499 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:37:35,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-14 21:37:35,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:36,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:37:37,264 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016017237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:37:37,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:37:37,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 103 [2024-11-14 21:37:37,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60127182] [2024-11-14 21:37:37,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:37:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-11-14 21:37:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:37,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-11-14 21:37:37,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2195, Invalid=8311, Unknown=0, NotChecked=0, Total=10506 [2024-11-14 21:37:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:37,271 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:37,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 4.233009708737864) internal successors, (436), 103 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:37,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:37,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:37,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:37,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:37,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:37,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:37,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:37:37,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:37:37,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:37:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:37:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:37:40,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 21:37:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:40,967 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:37:40,973 WARN L331 ript$VariableManager]: TermVariable v_~limit~0_Out_4 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 21:37:40,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1865356930, now seen corresponding path program 1 times [2024-11-14 21:37:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548591964] [2024-11-14 21:37:40,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:37:40,984 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 21:37:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:37:40,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 21:37:40,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:37:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash -161113347, now seen corresponding path program 7 times [2024-11-14 21:37:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:37:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903025386] [2024-11-14 21:37:40,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:37:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:37:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3848 backedges. 0 proven. 3848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:37:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903025386] [2024-11-14 21:37:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903025386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:37:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21504707] [2024-11-14 21:37:43,363 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 21:37:43,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:37:43,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:37:43,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:37:43,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 21:37:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:37:43,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-14 21:37:43,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:37:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3848 backedges. 0 proven. 3848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:45,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:37:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3848 backedges. 0 proven. 3848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:37:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21504707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:37:49,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:37:49,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 211 [2024-11-14 21:37:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043431815] [2024-11-14 21:37:49,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:37:49,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 211 states [2024-11-14 21:37:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:37:49,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2024-11-14 21:37:49,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9539, Invalid=34771, Unknown=0, NotChecked=0, Total=44310 [2024-11-14 21:37:49,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:49,461 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:37:49,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 211 states, 211 states have (on average 4.113744075829384) internal successors, (868), 211 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:37:49,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:37:49,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:38:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:38:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:38:03,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-14 21:38:03,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:38:03,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:38:03,521 WARN L331 ript$VariableManager]: TermVariable v_~limit~0_Out_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 21:38:03,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:38:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1865356921, now seen corresponding path program 1 times [2024-11-14 21:38:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:38:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815586496] [2024-11-14 21:38:03,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:38:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:38:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:38:03,527 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 21:38:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:38:03,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 21:38:03,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:38:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1370952341, now seen corresponding path program 8 times [2024-11-14 21:38:03,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:38:03,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011038199] [2024-11-14 21:38:03,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:38:03,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:38:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:38:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17960 backedges. 0 proven. 17960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:38:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:38:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011038199] [2024-11-14 21:38:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011038199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:38:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949348098] [2024-11-14 21:38:12,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 21:38:12,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:38:12,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:38:12,250 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:38:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 21:38:12,374 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 21:38:12,374 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:38:12,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-14 21:38:12,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:38:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17960 backedges. 0 proven. 17960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:38:19,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:38:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17960 backedges. 0 proven. 17960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:38:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949348098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:38:28,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:38:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145, 145] total 348 [2024-11-14 21:38:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268914270] [2024-11-14 21:38:28,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:38:28,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 348 states [2024-11-14 21:38:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:38:28,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 348 interpolants. [2024-11-14 21:38:28,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24748, Invalid=96008, Unknown=0, NotChecked=0, Total=120756 [2024-11-14 21:38:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:38:28,640 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:38:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 348 states, 348 states have (on average 4.094827586206897) internal successors, (1425), 348 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:38:28,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:38:28,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:38:28,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:38:28,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:38:28,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:39:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:39:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:39:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:39:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2024-11-14 21:39:07,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 21:39:07,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:39:07,437 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:39:07,440 WARN L331 ript$VariableManager]: TermVariable v_~limit~0_Out_8 not constructed by VariableManager. Cannot ensure absence of name clashes. [2024-11-14 21:39:07,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:39:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1865356912, now seen corresponding path program 1 times [2024-11-14 21:39:07,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:39:07,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630799448] [2024-11-14 21:39:07,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:39:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:39:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:39:07,447 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 21:39:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:39:07,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 21:39:07,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:39:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2106491253, now seen corresponding path program 9 times [2024-11-14 21:39:07,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:39:07,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797926989] [2024-11-14 21:39:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:39:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:39:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:39:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 40004 backedges. 39702 proven. 298 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 21:39:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:39:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797926989] [2024-11-14 21:39:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797926989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:39:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815839438] [2024-11-14 21:39:26,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 21:39:26,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:39:26,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:39:26,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:39:26,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 21:39:26,448 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 101 check-sat command(s) [2024-11-14 21:39:26,449 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 21:39:26,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 214 conjuncts are in the unsatisfiable core [2024-11-14 21:39:26,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:39:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 40004 backedges. 40004 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:39:51,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 21:39:51,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815839438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 21:39:51,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 21:39:51,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [210] imperfect sequences [207] total 412 [2024-11-14 21:39:51,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925430862] [2024-11-14 21:39:51,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 21:39:51,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 210 states [2024-11-14 21:39:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:39:51,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2024-11-14 21:39:51,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21030, Invalid=148302, Unknown=0, NotChecked=0, Total=169332 [2024-11-14 21:39:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:39:51,225 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:39:51,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 210 states, 210 states have (on average 4.104761904761904) internal successors, (862), 210 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:39:51,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:39:51,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:39:51,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:39:51,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 305 states. [2024-11-14 21:39:51,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:40:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:40:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:40:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2024-11-14 21:40:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 308 states. [2024-11-14 21:40:10,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 21:40:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-11-14 21:40:10,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:40:10,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:40:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 483368497, now seen corresponding path program 1 times [2024-11-14 21:40:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:40:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98785593] [2024-11-14 21:40:10,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:40:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:40:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:40:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 39700 backedges. 38612 proven. 1088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:40:29,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 21:40:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98785593] [2024-11-14 21:40:29,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98785593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 21:40:29,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870885949] [2024-11-14 21:40:29,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:40:29,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 21:40:29,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 21:40:29,790 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 21:40:29,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 21:40:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 21:40:29,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 409 conjuncts are in the unsatisfiable core [2024-11-14 21:40:29,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 21:41:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 39700 backedges. 0 proven. 39700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:41:00,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 21:41:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 39700 backedges. 0 proven. 39700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 21:41:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870885949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 21:41:29,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 21:41:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [210, 207, 207] total 613 [2024-11-14 21:41:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217616299] [2024-11-14 21:41:29,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 21:41:29,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 613 states [2024-11-14 21:41:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 21:41:29,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 613 interpolants. [2024-11-14 21:41:29,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11440, Invalid=363716, Unknown=0, NotChecked=0, Total=375156 [2024-11-14 21:41:29,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:41:29,977 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 21:41:29,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 613 states, 613 states have (on average 4.071778140293638) internal successors, (2496), 613 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 305 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 308 states. [2024-11-14 21:41:29,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:45:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 305 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 308 states. [2024-11-14 21:45:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1016 states. [2024-11-14 21:45:37,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 21:45:37,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 21:45:37,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 21:45:37,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 21:45:37,298 INFO L85 PathProgramCache]: Analyzing trace with hash 638549873, now seen corresponding path program 1 times [2024-11-14 21:45:37,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 21:45:37,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343137336] [2024-11-14 21:45:37,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 21:45:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 21:45:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:45:37,601 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 21:45:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 21:45:37,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 21:45:37,918 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-14 21:45:37,918 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 21:45:37,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 21:45:37,924 INFO L422 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 21:45:37,925 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/3) [2024-11-14 21:45:38,140 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 21:45:38,140 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 21:45:38,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 21:45:38,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 09:45:38 BasicIcfg [2024-11-14 21:45:38,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 21:45:38,155 INFO L158 Benchmark]: Toolchain (without parser) took 495865.02ms. Allocated memory was 83.9MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 56.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2024-11-14 21:45:38,155 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 21:45:38,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.41ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 36.1MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-14 21:45:38,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.55ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 34.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2024-11-14 21:45:38,155 INFO L158 Benchmark]: Boogie Preprocessor took 21.76ms. Allocated memory is still 83.9MB. Free memory was 34.5MB in the beginning and 33.6MB in the end (delta: 879.8kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 21:45:38,156 INFO L158 Benchmark]: RCFGBuilder took 251.05ms. Allocated memory is still 83.9MB. Free memory was 33.4MB in the beginning and 21.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-14 21:45:38,156 INFO L158 Benchmark]: TraceAbstraction took 495186.48ms. Allocated memory was 83.9MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 20.8MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2024-11-14 21:45:38,157 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.13ms. Allocated memory is still 83.9MB. Free memory is still 38.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 357.41ms. Allocated memory is still 83.9MB. Free memory was 56.2MB in the beginning and 36.1MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.55ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 34.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.76ms. Allocated memory is still 83.9MB. Free memory was 34.5MB in the beginning and 33.6MB in the end (delta: 879.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 251.05ms. Allocated memory is still 83.9MB. Free memory was 33.4MB in the beginning and 21.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 495186.48ms. Allocated memory was 83.9MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 20.8MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 447065, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 36889, dependent conditional: 36881, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 410218, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 42, dependent conditional: 34, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 410218, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 42, dependent conditional: 34, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 410396, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 220, dependent conditional: 212, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 410396, independent: 410176, independent conditional: 0, independent unconditional: 410176, dependent: 220, dependent conditional: 178, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 410396, independent: 410176, independent conditional: 0, independent unconditional: 410176, dependent: 220, dependent conditional: 178, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, independent: 1618, independent conditional: 0, independent unconditional: 1618, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1616, independent conditional: 0, independent unconditional: 1616, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 124, dependent conditional: 78, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 4, Protected Queries: 0 ], Cache Queries: [ total: 410396, independent: 408558, independent conditional: 0, independent unconditional: 408558, dependent: 184, dependent conditional: 150, dependent unconditional: 34, unknown: 1654, unknown conditional: 28, unknown unconditional: 1626] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1618, Positive conditional cache size: 0, Positive unconditional cache size: 1618, Negative cache size: 36, Negative conditional cache size: 28, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 408478, Maximal queried relation: 10, Independence queries for same thread: 36847, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 524, Number of trivial persistent sets: 466, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1740, independent: 1732, independent conditional: 0, independent unconditional: 1732, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 447065, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 36889, dependent conditional: 36881, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 410218, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 42, dependent conditional: 34, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 410218, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 42, dependent conditional: 34, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 410396, independent: 410176, independent conditional: 408444, independent unconditional: 1732, dependent: 220, dependent conditional: 212, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 410396, independent: 410176, independent conditional: 0, independent unconditional: 410176, dependent: 220, dependent conditional: 178, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 410396, independent: 410176, independent conditional: 0, independent unconditional: 410176, dependent: 220, dependent conditional: 178, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1654, independent: 1618, independent conditional: 0, independent unconditional: 1618, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1616, independent conditional: 0, independent unconditional: 1616, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 38, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 36, dependent conditional: 28, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 124, dependent conditional: 78, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 4, Protected Queries: 0 ], Cache Queries: [ total: 410396, independent: 408558, independent conditional: 0, independent unconditional: 408558, dependent: 184, dependent conditional: 150, dependent unconditional: 34, unknown: 1654, unknown conditional: 28, unknown unconditional: 1626] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1618, Positive conditional cache size: 0, Positive unconditional cache size: 1618, Negative cache size: 36, Negative conditional cache size: 28, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 408478, Maximal queried relation: 10, Independence queries for same thread: 36847 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; VAL [_N=0] [L755] 0 atomic_int limit; VAL [_N=0, limit=0] [L775] 0 _N = 100 [L776] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) VAL [\old(cond)=1, _N=100, cond=1, limit=0] [L776] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L777] 0 pthread_t t1, t2; VAL [_N=100, limit=0] [L778] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [_N=100, limit=0, t1=-1] [L757] 1 int i, bound; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0] [L758] 1 int lim = _N; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=0] [L779] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [_N=100, limit=0, t1=-1, t2=0] [L766] 2 int i, bound; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0] [L767] 2 int lim = _N + 1; VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=0] [L768] 2 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=101, limit=101] [L759] 1 limit = lim VAL [\old(arg)={0:0}, _N=100, arg={0:0}, lim=100, limit=100] [L760] 1 bound = limit VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, lim=100, limit=100] [L761] 1 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L769] 2 bound = limit VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, lim=101, limit=100] [L770] 2 i = 0 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=0, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=1, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=2, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=3, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=4, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=5, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=6, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=7, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=8, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=9, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=10, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=11, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=12, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=13, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=14, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=15, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=16, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=17, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=18, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=19, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=20, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=21, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=22, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=23, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=24, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=25, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=26, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=27, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=28, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=29, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=30, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=31, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=32, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=33, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=34, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=35, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=36, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=37, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=38, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=39, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=40, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=41, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=42, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=43, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=44, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=45, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=46, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=47, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=48, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=49, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=50, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=51, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=52, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=53, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=54, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=55, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=56, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=57, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=58, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=59, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=60, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=61, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=62, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=63, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=64, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=65, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=66, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=67, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=68, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=69, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=70, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=71, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=72, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=73, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=74, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=75, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=76, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=77, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=78, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=79, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=80, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=81, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=82, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=83, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=84, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=85, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=86, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=87, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=88, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=89, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=90, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=91, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=92, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=93, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=94, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=95, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=96, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=97, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=98, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L761] COND TRUE 1 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=100, limit=100] [L761] 1 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L770] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=99, lim=101, limit=100] [L770] 2 i++ VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L761] COND FALSE 1 !(i < bound) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L762] CALL 1 __VERIFIER_assert(i == lim) [L753] COND FALSE 1 !(!expression) VAL [\old(expression)=1, _N=100, expression=1, limit=100] [L762] RET 1 __VERIFIER_assert(i == lim) [L763] 1 return 0; VAL [\old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=100, limit=100] [L780] FCALL, JOIN 1 pthread_join(t1, 0) VAL [_N=100, limit=100, t1=-1, t2=0] [L770] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, bound=100, i=100, lim=101, limit=100] [L771] CALL 2 __VERIFIER_assert(i == lim) [L753] COND TRUE 2 !expression VAL [\old(expression)=0, _N=100, expression=0, limit=100] [L753] 2 reach_error() VAL [\old(expression)=0, _N=100, expression=0, limit=100] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 494.8s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 328.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 161.1s InterpolantComputationTime, 7375 NumberOfCodeBlocks, 7371 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 8716 ConstructedInterpolants, 0 QuantifiedInterpolants, 48274 SizeOfPredicates, 715 NumberOfNonLiveVariables, 5048 ConjunctsInSsa, 938 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 118373/267082 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: CheckTime: 0.1s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 70, TraceChecks: 4, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-14 21:45:38,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...