java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:43:03,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:43:03,480 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:43:03,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:43:03,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:43:03,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:43:03,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:43:03,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:43:03,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:43:03,506 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:43:03,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:43:03,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:43:03,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:43:03,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:43:03,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:43:03,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:43:03,517 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:43:03,521 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:43:03,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:43:03,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:43:03,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:43:03,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:43:03,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:43:03,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:43:03,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:43:03,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:43:03,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:43:03,543 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:43:03,544 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:43:03,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:43:03,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:43:03,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:43:03,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:43:03,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:43:03,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:43:03,549 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:43:03,550 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 14:43:03,570 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:43:03,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:43:03,571 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:43:03,571 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:43:03,572 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:43:03,572 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:43:03,572 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:43:03,573 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:43:03,573 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:43:03,573 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:43:03,573 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:43:03,573 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:43:03,573 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:43:03,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:43:03,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:43:03,576 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:43:03,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:43:03,576 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:43:03,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:43:03,577 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:43:03,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:43:03,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:43:03,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:43:03,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:43:03,577 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:43:03,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:43:03,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:43:03,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:43:03,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:43:03,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:43:03,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:43:03,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:43:03,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:43:03,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:43:03,582 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:43:03,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:43:03,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:43:03,583 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:43:03,583 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:43:03,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:43:03,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:43:03,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:43:03,645 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:43:03,646 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:43:03,647 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl [2019-01-07 14:43:03,647 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/codeblockAssertOrder01.bpl' [2019-01-07 14:43:03,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:43:03,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:43:03,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:43:03,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:43:03,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:43:03,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,725 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 14:43:03,725 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 14:43:03,726 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 14:43:03,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:43:03,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:43:03,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:43:03,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:43:03,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... [2019-01-07 14:43:03,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:43:03,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:43:03,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:43:03,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:43:03,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:43:03,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 14:43:03,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 14:43:04,077 INFO L278 CfgBuilder]: Using library mode [2019-01-07 14:43:04,077 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-07 14:43:04,078 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:43:04 BoogieIcfgContainer [2019-01-07 14:43:04,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:43:04,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:43:04,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:43:04,083 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:43:04,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:43:03" (1/2) ... [2019-01-07 14:43:04,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4781cfb3 and model type codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:43:04, skipping insertion in model container [2019-01-07 14:43:04,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:43:04" (2/2) ... [2019-01-07 14:43:04,086 INFO L112 eAbstractionObserver]: Analyzing ICFG codeblockAssertOrder01.bpl [2019-01-07 14:43:04,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:43:04,102 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:43:04,117 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:43:04,148 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:43:04,148 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:43:04,149 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:43:04,149 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:43:04,149 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:43:04,149 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:43:04,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:43:04,150 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:43:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 14:43:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:43:04,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:04,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:43:04,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:04,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-07 14:43:04,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:04,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:04,457 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} i := 0; {11#(<= main_i 0)} is VALID [2019-01-07 14:43:04,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= main_i 0)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {10#false} is VALID [2019-01-07 14:43:04,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(a[q] == 5); {10#false} is VALID [2019-01-07 14:43:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:04,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:43:04,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:43:04,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:43:04,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:43:04,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:04,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:43:04,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:04,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:43:04,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:43:04,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:43:04,551 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 14:43:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:04,639 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 14:43:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:43:04,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:43:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:43:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-07 14:43:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:43:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-01-07 14:43:04,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-01-07 14:43:04,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:04,720 INFO L225 Difference]: With dead ends: 11 [2019-01-07 14:43:04,720 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 14:43:04,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:43:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 14:43:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 14:43:04,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:04,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:04,789 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:04,789 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:04,791 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:43:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:43:04,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:04,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:04,792 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:04,792 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:43:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:04,793 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:43:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:43:04,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:04,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:04,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:04,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:43:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 14:43:04,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 14:43:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:04,798 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 14:43:04,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:43:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:43:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:43:04,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:43:04,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:43:04,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:43:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-07 14:43:04,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:43:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:04,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:43:04,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:43:04,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:43:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:43:04,959 INFO L273 TraceCheckUtils]: 0: Hoare triple {44#true} i := 0; {46#(<= main_i 0)} is VALID [2019-01-07 14:43:04,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#(<= main_i 0)} assume i <= 1000;i := i + 1; {47#(<= main_i 1)} is VALID [2019-01-07 14:43:04,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#(<= main_i 1)} assume !(i <= 1000);a := a[p := 5];assume p > 41 && p < 43;assume q > 41 && q < 43; {45#false} is VALID [2019-01-07 14:43:04,962 INFO L273 TraceCheckUtils]: 3: Hoare triple {45#false} assume !(a[q] == 5); {45#false} is VALID [2019-01-07 14:43:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:43:04,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:43:04,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:43:04,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 14:43:04,966 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-07 14:43:05,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:43:05,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:43:08,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 14:43:08,016 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 1 different actions 12 times. Widened at 1 different actions 8 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 14:43:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:43:08,025 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 14:43:09,261 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 50% of their original sizes. [2019-01-07 14:43:09,266 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 14:43:11,508 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_115 Int) (v_idx_113 Int) (v_idx_114 Int)) (exists ((v_b_48_1 Int) (v_b_49_1 Int) (v_v_415_1 Int) (v_v_416_1 Int) (v_v_417_1 Int)) (let ((.cse4 (* 2 v_b_48_1)) (.cse5 (* 2 v_v_416_1)) (.cse11 (* 2 v_b_49_1)) (.cse12 (* 2 c_main_q)) (.cse10 (+ v_b_48_1 v_b_49_1)) (.cse7 (+ v_b_49_1 c_main_q)) (.cse2 (+ v_b_48_1 v_v_416_1)) (.cse13 (+ v_b_48_1 c_main_q)) (.cse6 (+ v_b_48_1 1)) (.cse1 (+ v_v_416_1 37)) (.cse9 (+ v_b_49_1 v_v_416_1)) (.cse3 (+ c_main_q 1)) (.cse8 (+ v_v_416_1 38)) (.cse0 (+ c_main_q v_v_416_1))) (and (<= 47 .cse0) (<= .cse1 c_main_q) (<= c_main_q .cse1) (<= .cse2 47) (= v_b_49_1 .cse3) (<= .cse4 84) (= v_b_49_1 43) (<= .cse5 10) (<= .cse6 v_b_49_1) (<= 84 .cse4) (<= 10 .cse5) (= .cse7 85) (= v_b_49_1 .cse8) (= v_b_48_1 42) (<= .cse8 v_b_49_1) (<= 48 .cse9) (or (= (select c_main_a v_idx_115) v_v_417_1) (< v_idx_115 v_b_49_1)) (<= v_b_49_1 .cse3) (= 43 v_b_49_1) (= .cse10 85) (= 5 v_v_416_1) (= c_main_q 42) (or (= v_v_415_1 (select c_main_a v_idx_113)) (<= v_b_48_1 v_idx_113)) (<= v_b_48_1 c_main_q) (= 42 v_b_48_1) (<= .cse10 85) (<= 86 .cse11) (<= .cse12 84) (<= v_b_48_1 .cse1) (<= c_main_q v_b_48_1) (<= .cse11 86) (= .cse11 86) (<= 84 .cse12) (<= .cse13 84) (= .cse9 48) (<= 85 .cse10) (<= .cse7 85) (<= 85 .cse7) (<= 47 .cse2) (<= 84 .cse13) (<= v_b_49_1 .cse6) (<= .cse1 v_b_48_1) (<= .cse9 48) (<= .cse3 v_b_49_1) (<= v_b_49_1 .cse8) (or (<= v_b_49_1 v_idx_114) (= v_v_416_1 (select c_main_a v_idx_114)) (< v_idx_114 v_b_48_1)) (<= .cse0 47))))) is different from false [2019-01-07 14:43:11,609 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-07 14:43:11,826 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 14:43:11,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 14:43:11,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-07 14:43:11,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:43:11,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:43:11,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:43:11,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:43:11,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:11,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:43:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:43:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2019-01-07 14:43:11,845 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-07 14:43:11,851 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:43:11,852 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:43:11,853 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:43:11,854 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:43:11,854 WARN L224 ngHoareTripleChecker]: Pre: {86#(forall ((v_idx_134 Int)) (exists ((v_v_467_1 Int)) (and (<= (- (- c_main_i) c_main_i) 0) (= v_v_467_1 (select c_main_a v_idx_134)))))} [2019-01-07 14:43:11,855 WARN L228 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-07 14:43:11,855 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-07 14:43:11,856 WARN L230 ngHoareTripleChecker]: Post: {87#false} [2019-01-07 14:43:11,856 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:43:11,858 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:43:11,858 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:43:11,873 WARN L270 ngHoareTripleChecker]: Pre: {86#(<= (- (- main_i) main_i) 0)} [2019-01-07 14:43:11,873 WARN L274 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-07 14:43:11,874 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-07 14:43:11,911 WARN L276 ngHoareTripleChecker]: Post: {87#false} [2019-01-07 14:43:11,912 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:43:11,913 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:43:11,913 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[main_a] -> [-inf_0] v_467 [inf_0], }, Substate: {ints: {main_i = [0; inf]}, 4 vars top, }}} [2019-01-07 14:43:11,914 WARN L628 ntHoareTripleChecker]: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) (assume i <= 1000;i := i + 1;) [2019-01-07 14:43:11,914 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-07 14:43:11,915 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:43:12,235 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:43:12,236 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:43:12,236 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:43:12,237 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:43:12,237 WARN L224 ngHoareTripleChecker]: Pre: {88#(forall ((v_idx_143 Int)) (exists ((v_v_468_1 Int)) (and (<= (- (- c_main_i) c_main_i) 0) (= v_v_468_1 (select c_main_a v_idx_143)))))} [2019-01-07 14:43:12,237 WARN L228 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-07 14:43:12,238 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-07 14:43:12,238 WARN L230 ngHoareTripleChecker]: Post: {89#(forall ((v_idx_146 Int) (v_idx_144 Int) (v_idx_145 Int)) (exists ((v_b_48_1 Int) (v_b_49_1 Int) (v_v_415_1 Int) (v_v_416_1 Int) (v_v_417_1 Int)) (and (<= (- (- v_b_48_1) c_main_q) (- 84)) (<= (- v_b_48_1 (- v_v_416_1)) 47) (= 43 (+ (- v_b_48_1) 85)) (= 43 (+ (- c_main_q) 85)) (<= (- (- v_b_49_1) c_main_q) (- 85)) (= 42 (+ (- v_b_49_1) 85)) (= 43 (+ v_b_48_1 1)) (<= (- (- c_main_q) (- v_v_416_1)) (- 37)) (<= (- v_b_49_1 v_v_416_1) 38) (= 43 v_b_49_1) (<= (- c_main_q (- c_main_q)) 84) (<= (- v_b_49_1 (- v_b_49_1)) 86) (<= (- c_main_q v_v_416_1) 37) (<= (- (- c_main_q) v_v_416_1) (- 47)) (= c_main_q (+ (- v_b_49_1) 85)) (<= (- v_b_49_1 (- c_main_q)) 85) (or (= (select c_main_a v_idx_144) v_v_415_1) (<= v_b_48_1 v_idx_144)) (<= (- (- v_b_49_1) (- v_v_416_1)) (- 38)) (= (+ v_v_416_1 37) (+ (- v_b_49_1) 85)) (<= (- v_b_49_1 c_main_q) 1) (= (+ (- v_v_416_1) 47) (+ (- v_b_49_1) 85)) (<= (- (- v_b_49_1) v_v_416_1) (- 48)) (= (+ v_b_49_1 (- 1)) (+ (- v_b_49_1) 85)) (<= (- c_main_q (- v_v_416_1)) 47) (or (< v_idx_145 v_b_48_1) (= (select c_main_a v_idx_145) v_v_416_1) (<= v_b_49_1 v_idx_145)) (<= (- v_b_48_1 v_b_49_1) (- 1)) (<= (- (- c_main_q) c_main_q) (- 84)) (<= (- (- v_b_48_1) v_b_49_1) (- 85)) (= v_b_48_1 (+ (- v_b_49_1) 85)) (<= (- v_b_48_1 c_main_q) 0) (<= (- (- v_b_48_1) (- v_b_49_1)) 1) (<= (- v_b_49_1 (- v_v_416_1)) 48) (or (= (select c_main_a v_idx_146) v_v_417_1) (< v_idx_146 v_b_49_1)) (<= (- (- v_v_416_1) v_v_416_1) (- 10)) (= (+ c_main_q 1) 43) (<= (- (- v_b_49_1) v_b_49_1) (- 86)) (<= (- v_b_48_1 (- v_b_48_1)) 84) (<= (- (- v_b_48_1) (- v_v_416_1)) (- 37)) (<= (- (- v_b_48_1) v_v_416_1) (- 47)) (<= (- v_b_48_1 (- v_b_49_1)) 85) (<= (- v_b_48_1 (- c_main_q)) 84) (<= (- (- v_b_48_1) v_b_48_1) (- 84)) (<= (- v_v_416_1 (- v_v_416_1)) 10) (<= (- (- v_b_48_1) (- c_main_q)) 0) (= (+ (- c_main_q) 84) (+ (- v_b_49_1) 85)) (= (+ (- v_v_416_1) 48) 43) (= 43 (+ v_v_416_1 38)) (<= (- v_b_48_1 v_v_416_1) 37) (<= (- (- v_b_49_1) (- c_main_q)) (- 1)))))} [2019-01-07 14:43:12,238 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:43:12,239 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:43:12,239 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:43:12,249 WARN L270 ngHoareTripleChecker]: Pre: {88#(<= (- (- main_i) main_i) 0)} [2019-01-07 14:43:12,249 WARN L274 ngHoareTripleChecker]: Action: assume i <= 1000;i := i + 1; [2019-01-07 14:43:12,249 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) [2019-01-07 14:43:12,844 WARN L276 ngHoareTripleChecker]: Post: {89#(and (= 43 (+ (- main_q) 85)) (<= (- main_q (- main_q)) 84) (<= (- (- main_q) main_q) (- 84)) (= (+ main_q 1) 43) (<= 42 main_q) (= main_q 42) (<= main_q 42) (forall ((v_idx_145 Int)) (or (<= 43 v_idx_145) (= (select main_a v_idx_145) 5) (< v_idx_145 42))))} [2019-01-07 14:43:12,845 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:43:12,845 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:43:12,845 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[main_a] -> [-inf_0] v_468 [inf_0], }, Substate: {ints: {main_i = [0; inf]}, 4 vars top, }}} [2019-01-07 14:43:12,845 WARN L628 ntHoareTripleChecker]: (and (= c_main_i_primed (+ c_main_i 1)) (<= c_main_i 1000)) (assume i <= 1000;i := i + 1;) [2019-01-07 14:43:12,845 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {[main_a] -> [-inf_0] v_415 [b_48] v_416 [b_49] v_417 [inf_0], }, Substate: {ints: {b_48 = [42; 42]; v_416 = [5; 5]; main_q = [42; 42]; b_49 = [43; 43]}, 2 vars top, relations: {b_48 + v_416 = [47; 47]; b_48 - v_416 = [37; 37]; main_q + v_416 = [47; 47]; main_q - v_416 = [37; 37]; b_49 + v_416 = [48; 48]; b_49 - v_416 = [38; 38]; b_48 + main_q = [84; 84]; b_48 - main_q = [0; 0]; b_49 + main_q = [85; 85]; b_49 - main_q = [1; 1]; b_48 + b_49 = [85; 85]; b_48 - b_49 = [-1; -1]}, }}} [2019-01-07 14:43:12,846 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:43:17,017 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_115 Int) (v_idx_113 Int) (v_idx_114 Int)) (exists ((v_b_48_1 Int) (v_b_49_1 Int) (v_v_415_1 Int) (v_v_416_1 Int) (v_v_417_1 Int)) (let ((.cse4 (* 2 v_b_48_1)) (.cse5 (* 2 v_v_416_1)) (.cse11 (* 2 v_b_49_1)) (.cse12 (* 2 c_main_q)) (.cse10 (+ v_b_48_1 v_b_49_1)) (.cse7 (+ v_b_49_1 c_main_q)) (.cse2 (+ v_b_48_1 v_v_416_1)) (.cse13 (+ v_b_48_1 c_main_q)) (.cse6 (+ v_b_48_1 1)) (.cse1 (+ v_v_416_1 37)) (.cse9 (+ v_b_49_1 v_v_416_1)) (.cse3 (+ c_main_q 1)) (.cse8 (+ v_v_416_1 38)) (.cse0 (+ c_main_q v_v_416_1))) (and (<= 47 .cse0) (<= .cse1 c_main_q) (<= c_main_q .cse1) (<= .cse2 47) (= v_b_49_1 .cse3) (<= .cse4 84) (= v_b_49_1 43) (<= .cse5 10) (<= .cse6 v_b_49_1) (<= 84 .cse4) (<= 10 .cse5) (= .cse7 85) (= v_b_49_1 .cse8) (= v_b_48_1 42) (<= .cse8 v_b_49_1) (<= 48 .cse9) (or (= (select c_main_a v_idx_115) v_v_417_1) (< v_idx_115 v_b_49_1)) (<= v_b_49_1 .cse3) (= 43 v_b_49_1) (= .cse10 85) (= 5 v_v_416_1) (= c_main_q 42) (or (= v_v_415_1 (select c_main_a v_idx_113)) (<= v_b_48_1 v_idx_113)) (<= v_b_48_1 c_main_q) (= 42 v_b_48_1) (<= .cse10 85) (<= 86 .cse11) (<= .cse12 84) (<= v_b_48_1 .cse1) (<= c_main_q v_b_48_1) (<= .cse11 86) (= .cse11 86) (<= 84 .cse12) (<= .cse13 84) (= .cse9 48) (<= 85 .cse10) (<= .cse7 85) (<= 85 .cse7) (<= 47 .cse2) (<= 84 .cse13) (<= v_b_49_1 .cse6) (<= .cse1 v_b_48_1) (<= .cse9 48) (<= .cse3 v_b_49_1) (<= v_b_49_1 .cse8) (or (<= v_b_49_1 v_idx_114) (= v_v_416_1 (select c_main_a v_idx_114)) (< v_idx_114 v_b_48_1)) (<= .cse0 47))))) (<= 0 (* 2 c_main_i))) is different from false [2019-01-07 14:43:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:17,365 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:43:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:43:17,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 14:43:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:43:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-07 14:43:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:43:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-07 14:43:17,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 4 transitions. [2019-01-07 14:43:17,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:43:17,386 INFO L225 Difference]: With dead ends: 5 [2019-01-07 14:43:17,386 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:43:17,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2019-01-07 14:43:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:43:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:43:17,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:43:17,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:17,389 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:17,389 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:17,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:17,389 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:43:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:43:17,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:17,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:17,390 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:17,390 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:43:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:43:17,390 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:43:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:43:17,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:17,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:43:17,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:43:17,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:43:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:43:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:43:17,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-01-07 14:43:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:43:17,392 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:43:17,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:43:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:43:17,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:43:17,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 14:43:17,410 INFO L444 ceAbstractionStarter]: At program point L15-1(lines 15 17) the Hoare annotation is: (<= 0 (* 2 main_i)) [2019-01-07 14:43:17,410 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 10 22) no Hoare annotation was computed. [2019-01-07 14:43:17,410 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2019-01-07 14:43:17,411 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2019-01-07 14:43:17,411 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 21) no Hoare annotation was computed. [2019-01-07 14:43:17,411 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-07 14:43:17,412 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2019-01-07 14:43:17,413 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-07 14:43:17,414 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-07 14:43:17,414 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2019-01-07 14:43:17,414 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2019-01-07 14:43:17,414 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-07 14:43:17,419 INFO L202 PluginConnector]: Adding new model codeblockAssertOrder01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:43:17 BoogieIcfgContainer [2019-01-07 14:43:17,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:43:17,420 INFO L168 Benchmark]: Toolchain (without parser) took 13732.25 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -514.5 MB). Peak memory consumption was 182.3 MB. Max. memory is 7.1 GB. [2019-01-07 14:43:17,422 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:43:17,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:43:17,423 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:43:17,424 INFO L168 Benchmark]: RCFGBuilder took 321.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-01-07 14:43:17,425 INFO L168 Benchmark]: TraceAbstraction took 13339.46 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -535.7 MB). Peak memory consumption was 161.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:43:17,429 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 321.42 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13339.46 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 696.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -535.7 MB). Peak memory consumption was 161.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 <= 2 * i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 13.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 1 SDslu, 4 SDs, 0 SdLazy, 3 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 5 HoareAnnotationTreeSize, 1 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 29 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...