/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-theta/unwind1-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 04:35:08,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:35:08,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 04:35:08,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:35:08,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:35:08,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:35:08,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:35:08,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:35:08,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:35:08,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:35:08,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:35:08,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 04:35:08,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:35:08,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:35:08,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:35:08,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 04:35:08,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 04:35:08,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:35:08,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:35:08,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 04:35:08,728 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 04:35:08,728 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 04:35:08,728 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 [2024-11-14 04:35:08,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:35:08,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:35:09,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:35:09,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:35:09,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:35:09,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-theta/unwind1-100.i [2024-11-14 04:35:10,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:35:10,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:35:10,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-theta/unwind1-100.i [2024-11-14 04:35:10,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d11913432/4774214fffef4ec292defc2ea5aa3469/FLAG4670f5e66 [2024-11-14 04:35:10,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/d11913432/4774214fffef4ec292defc2ea5aa3469 [2024-11-14 04:35:10,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:35:10,898 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 04:35:10,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:35:10,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:35:10,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:35:10,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:10" (1/1) ... [2024-11-14 04:35:10,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a63452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:10, skipping insertion in model container [2024-11-14 04:35:10,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:10" (1/1) ... [2024-11-14 04:35:10,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:35:11,164 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/unwind1-100.i[33026,33039] [2024-11-14 04:35:11,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:35:11,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:35:11,222 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/unwind1-100.i[33026,33039] [2024-11-14 04:35:11,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:35:11,267 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:35:11,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11 WrapperNode [2024-11-14 04:35:11,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:35:11,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:35:11,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:35:11,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:35:11,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,310 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-14 04:35:11,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:35:11,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:35:11,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:35:11,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:35:11,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:35:11,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:35:11,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:35:11,349 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:35:11,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2024-11-14 04:35:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:35:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:11,382 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 04:35:11,387 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 04:35:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:35:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-14 04:35:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-14 04:35:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-14 04:35:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-14 04:35:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:35:11,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:35:11,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:35:11,411 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 04:35:11,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:35:11,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:35:11,687 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 04:35:11,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:35:11,694 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:35:11,695 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 04:35:11,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:11 BoogieIcfgContainer [2024-11-14 04:35:11,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:35:11,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:35:11,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:35:11,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:35:11,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:35:10" (1/3) ... [2024-11-14 04:35:11,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a070ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:11, skipping insertion in model container [2024-11-14 04:35:11,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (2/3) ... [2024-11-14 04:35:11,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a070ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:11, skipping insertion in model container [2024-11-14 04:35:11,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:11" (3/3) ... [2024-11-14 04:35:11,704 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-14 04:35:11,717 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:35:11,720 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 04:35:11,720 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 04:35:11,793 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 04:35:11,845 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:35:11,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 04:35:11,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:11,849 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 04:35:11,852 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 04:35:11,940 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 04:35:11,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2024-11-14 04:35:11,957 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;@2b38ed3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:35:11,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 04:35:12,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:12,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1042050771, now seen corresponding path program 1 times [2024-11-14 04:35:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518211715] [2024-11-14 04:35:12,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:12,318 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 04:35:12,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:12,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518211715] [2024-11-14 04:35:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518211715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:35:12,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398058924] [2024-11-14 04:35:12,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:12,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:35:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:12,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:35:12,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:35:12,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,345 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:12,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 04:35:12,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:35:12,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1315237952, now seen corresponding path program 1 times [2024-11-14 04:35:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371728391] [2024-11-14 04:35:12,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:12,706 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 04:35:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:12,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371728391] [2024-11-14 04:35:12,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371728391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:12,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 04:35:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887482172] [2024-11-14 04:35:12,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:12,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:35:12,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:12,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:35:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:35:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,712 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:12,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 04:35:12,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:35:12,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:35:12,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 386446821, now seen corresponding path program 1 times [2024-11-14 04:35:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895767316] [2024-11-14 04:35:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895767316] [2024-11-14 04:35:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895767316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335292806] [2024-11-14 04:35:13,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:13,056 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 04:35:13,058 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 04:35:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:13,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:35:13,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:35:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:13,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335292806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:35:13,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-14 04:35:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609207303] [2024-11-14 04:35:13,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 04:35:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:13,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 04:35:13,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-14 04:35:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:13,538 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:13,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.368421052631579) internal successors, (121), 19 states have internal predecessors, (121), 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 04:35:13,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:13,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:35:13,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:35:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:35:13,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:35:14,060 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 04:35:14,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:14,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1719110993, now seen corresponding path program 2 times [2024-11-14 04:35:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888639296] [2024-11-14 04:35:14,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888639296] [2024-11-14 04:35:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888639296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992124409] [2024-11-14 04:35:14,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:35:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:14,321 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 04:35:14,323 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 04:35:14,399 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:35:14,400 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:35:14,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:35:14,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:35:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:35:14,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:35:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992124409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:35:14,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:14,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2024-11-14 04:35:14,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702308909] [2024-11-14 04:35:14,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:14,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 04:35:14,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:14,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 04:35:14,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-14 04:35:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:14,737 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:14,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.842105263157895) internal successors, (111), 19 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:35:14,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:14,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:35:14,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:35:14,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:35:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 04:35:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 04:35:15,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:35:15,957 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 04:35:15,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:15,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 481148698, now seen corresponding path program 3 times [2024-11-14 04:35:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68913329] [2024-11-14 04:35:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:35:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68913329] [2024-11-14 04:35:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68913329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:16,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:35:16,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:35:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808223672] [2024-11-14 04:35:16,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:35:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:16,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:35:16,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:35:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:16,052 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:16,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 04:35:16,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:16,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:35:16,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-14 04:35:16,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-14 04:35:16,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:16,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:35:16,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:16,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1599872117, now seen corresponding path program 1 times [2024-11-14 04:35:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813233380] [2024-11-14 04:35:16,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:16,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813233380] [2024-11-14 04:35:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813233380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930254365] [2024-11-14 04:35:16,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:16,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:16,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:16,893 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 04:35:16,895 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 04:35:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:16,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:35:16,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:35:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:17,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:17,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930254365] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:35:17,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:17,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2024-11-14 04:35:17,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36253110] [2024-11-14 04:35:17,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:17,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-14 04:35:17,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:17,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-14 04:35:17,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 04:35:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:17,446 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:17,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.0) internal successors, (140), 35 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:35:17,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:17,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:17,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:17,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:17,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:17,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:35:18,459 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 04:35:18,643 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 04:35:18,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:18,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1015781970, now seen corresponding path program 2 times [2024-11-14 04:35:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491772302] [2024-11-14 04:35:18,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:19,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491772302] [2024-11-14 04:35:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491772302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890459587] [2024-11-14 04:35:19,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:35:19,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:19,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:19,067 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 04:35:19,068 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 04:35:19,130 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:35:19,130 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:35:19,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 04:35:19,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:35:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:19,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:20,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890459587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:35:20,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 65 [2024-11-14 04:35:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037842567] [2024-11-14 04:35:20,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:20,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-11-14 04:35:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:20,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-11-14 04:35:20,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=3266, Unknown=0, NotChecked=0, Total=4160 [2024-11-14 04:35:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:20,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.076923076923077) internal successors, (200), 65 states have internal predecessors, (200), 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 04:35:20,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:20,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:20,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:20,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:20,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:20,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:35:20,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:35:22,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:35:22,715 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 04:35:22,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:22,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:22,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash -6179680, now seen corresponding path program 3 times [2024-11-14 04:35:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316863568] [2024-11-14 04:35:22,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:22,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:24,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316863568] [2024-11-14 04:35:24,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316863568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:24,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873740799] [2024-11-14 04:35:24,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:35:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:24,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:24,109 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 04:35:24,110 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 04:35:24,187 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2024-11-14 04:35:24,187 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:35:24,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 04:35:24,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:35:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:25,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873740799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:35:26,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 125 [2024-11-14 04:35:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613056784] [2024-11-14 04:35:26,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:26,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2024-11-14 04:35:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:26,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2024-11-14 04:35:26,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3374, Invalid=12126, Unknown=0, NotChecked=0, Total=15500 [2024-11-14 04:35:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:26,590 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:26,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 2.56) internal successors, (320), 125 states have internal predecessors, (320), 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 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:35:26,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:35:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2024-11-14 04:35:33,769 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 04:35:33,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:33,956 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:35:33,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:35:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash 208028804, now seen corresponding path program 4 times [2024-11-14 04:35:33,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:35:33,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779661238] [2024-11-14 04:35:33,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:35:33,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:35:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:35:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:35:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779661238] [2024-11-14 04:35:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779661238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:35:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94815404] [2024-11-14 04:35:37,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 04:35:37,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:35:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:35:37,304 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 04:35:37,305 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 04:35:37,394 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 04:35:37,394 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:35:37,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-14 04:35:37,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:35:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:40,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:35:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:35:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94815404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:35:45,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:45,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 245 [2024-11-14 04:35:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37933191] [2024-11-14 04:35:45,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:35:45,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 245 states [2024-11-14 04:35:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:35:45,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2024-11-14 04:35:45,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13134, Invalid=46646, Unknown=0, NotChecked=0, Total=59780 [2024-11-14 04:35:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:45,307 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:35:45,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 245 states, 245 states have (on average 2.2857142857142856) internal successors, (560), 245 states have internal predecessors, (560), 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 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2024-11-14 04:35:45,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:36:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2024-11-14 04:36:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 362 states. [2024-11-14 04:36:10,083 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 04:36:10,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:10,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:36:10,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:36:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1907413940, now seen corresponding path program 5 times [2024-11-14 04:36:10,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:36:10,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19511673] [2024-11-14 04:36:10,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:36:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:36:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:36:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:36:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 04:36:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19511673] [2024-11-14 04:36:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19511673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:36:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111070139] [2024-11-14 04:36:20,575 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 04:36:20,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:36:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 04:36:20,577 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 04:36:20,578 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 04:36:20,736 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2024-11-14 04:36:20,737 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:36:20,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-11-14 04:36:20,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:36:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:36:31,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:36:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:36:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111070139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:36:41,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:36:41,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164, 164] total 368 [2024-11-14 04:36:41,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171301743] [2024-11-14 04:36:41,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:36:41,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 368 states [2024-11-14 04:36:41,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 04:36:41,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 368 interpolants. [2024-11-14 04:36:41,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27195, Invalid=107861, Unknown=0, NotChecked=0, Total=135056 [2024-11-14 04:36:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:36:41,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 04:36:41,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 368 states, 368 states have (on average 2.1956521739130435) internal successors, (808), 368 states have internal predecessors, (808), 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 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 362 states. [2024-11-14 04:36:41,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:37:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 362 states. [2024-11-14 04:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 548 states. [2024-11-14 04:37:36,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 04:37:36,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:37:36,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [f2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:37:36,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:37:36,969 INFO L85 PathProgramCache]: Analyzing trace with hash -881736198, now seen corresponding path program 6 times [2024-11-14 04:37:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 04:37:36,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121873187] [2024-11-14 04:37:36,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:37:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:37:37,108 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:37:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:37:37,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-14 04:37:37,358 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:37:37,359 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:37:37,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 04:37:37,363 INFO L422 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1] [2024-11-14 04:37:37,364 INFO L320 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was UNSAFE (1/2) [2024-11-14 04:37:37,556 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 04:37:37,556 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:37:37,579 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 04:37:37,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:37:37 BasicIcfg [2024-11-14 04:37:37,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:37:37,580 INFO L158 Benchmark]: Toolchain (without parser) took 146681.90ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 71.8MB in the beginning and 750.4MB in the end (delta: -678.6MB). Peak memory consumption was 835.2MB. Max. memory is 8.0GB. [2024-11-14 04:37:37,580 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 04:37:37,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.54ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 51.5MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-11-14 04:37:37,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.47ms. Allocated memory is still 100.7MB. Free memory was 51.5MB in the beginning and 50.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 04:37:37,581 INFO L158 Benchmark]: Boogie Preprocessor took 32.65ms. Allocated memory is still 100.7MB. Free memory was 50.0MB in the beginning and 48.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 04:37:37,581 INFO L158 Benchmark]: RCFGBuilder took 346.22ms. Allocated memory is still 100.7MB. Free memory was 48.9MB in the beginning and 37.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-14 04:37:37,581 INFO L158 Benchmark]: TraceAbstraction took 145882.09ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 36.6MB in the beginning and 750.4MB in the end (delta: -713.8MB). Peak memory consumption was 801.7MB. Max. memory is 8.0GB. [2024-11-14 04:37:37,582 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.20ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.54ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 51.5MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.47ms. Allocated memory is still 100.7MB. Free memory was 51.5MB in the beginning and 50.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.65ms. Allocated memory is still 100.7MB. Free memory was 50.0MB in the beginning and 48.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 346.22ms. Allocated memory is still 100.7MB. Free memory was 48.9MB in the beginning and 37.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 145882.09ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 36.6MB in the beginning and 750.4MB in the end (delta: -713.8MB). Peak memory consumption was 801.7MB. 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: 11482, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 234, dependent conditional: 229, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11260, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11260, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11302, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 54, dependent conditional: 49, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11302, independent: 11248, independent conditional: 0, independent unconditional: 11248, dependent: 54, dependent conditional: 42, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11302, independent: 11248, independent conditional: 0, independent unconditional: 11248, dependent: 54, dependent conditional: 42, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 795, independent: 781, independent conditional: 0, independent unconditional: 781, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 795, independent: 780, independent conditional: 0, independent unconditional: 780, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 94, dependent conditional: 43, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 11302, independent: 10467, independent conditional: 0, independent unconditional: 10467, dependent: 40, dependent conditional: 33, dependent unconditional: 7, unknown: 795, unknown conditional: 9, unknown unconditional: 786] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 781, Positive conditional cache size: 0, Positive unconditional cache size: 781, Negative cache size: 14, Negative conditional cache size: 9, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10456, Maximal queried relation: 9, Independence queries for same thread: 222, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 196, Number of trivial persistent sets: 171, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 804, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11482, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 234, dependent conditional: 229, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11260, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11260, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11302, independent: 11248, independent conditional: 10449, independent unconditional: 799, dependent: 54, dependent conditional: 49, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11302, independent: 11248, independent conditional: 0, independent unconditional: 11248, dependent: 54, dependent conditional: 42, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11302, independent: 11248, independent conditional: 0, independent unconditional: 11248, dependent: 54, dependent conditional: 42, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 795, independent: 781, independent conditional: 0, independent unconditional: 781, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 795, independent: 780, independent conditional: 0, independent unconditional: 780, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 157, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 94, dependent conditional: 43, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 11302, independent: 10467, independent conditional: 0, independent unconditional: 10467, dependent: 40, dependent conditional: 33, dependent unconditional: 7, unknown: 795, unknown conditional: 9, unknown unconditional: 786] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 781, Positive conditional cache size: 0, Positive unconditional cache size: 781, Negative cache size: 14, Negative conditional cache size: 9, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10456, Maximal queried relation: 9, Independence queries for same thread: 222 - 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] [L772] 0 _N = 100 [L773] 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] [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; VAL [_N=100, limit=0] [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0] [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L762] 1 return 0; VAL [\old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, limit=101] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, limit=101, t1=-1, t2=0] [L765] 2 int i, bound; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, limit=101] [L766] 2 bound = limit VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, limit=101] [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L777] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, limit=101, t1=-1, t2=0] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, _N=100, arg={0:0}, expression=0, limit=101] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, _N=100, arg={0:0}, expression=0, limit=101] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: f2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 105 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 145.4s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 92.7s, 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: 1317, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 49.7s InterpolantComputationTime, 2563 NumberOfCodeBlocks, 2563 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 3057 ConstructedInterpolants, 0 QuantifiedInterpolants, 13487 SizeOfPredicates, 334 NumberOfNonLiveVariables, 1685 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 18/48924 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.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:37:37,613 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...