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/CountTillBound-Jupiter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:29:50,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:29:50,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:29:50,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:29:50,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:29:50,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:29:50,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:29:50,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:29:50,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:29:50,732 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:29:50,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:29:50,733 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:29:50,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:29:50,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:29:50,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:29:50,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:29:50,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:29:50,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:29:50,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:29:50,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:29:50,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:29:50,746 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:29:50,748 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:29:50,749 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:29:50,749 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:29:50,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:29:50,751 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:29:50,752 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:29:50,752 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:29:50,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:29:50,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:29:50,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:29:50,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:29:50,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:29:50,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:29:50,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:29:50,757 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 [2018-12-17 14:29:50,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:29:50,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:29:50,774 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:29:50,774 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:29:50,774 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:29:50,774 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:29:50,775 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:29:50,775 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:29:50,775 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-17 14:29:50,775 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-17 14:29:50,775 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:29:50,776 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:29:50,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:29:50,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:29:50,777 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:29:50,777 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:29:50,777 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:29:50,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:29:50,778 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:29:50,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:29:50,778 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:29:50,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:29:50,778 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:29:50,778 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:29:50,779 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:29:50,779 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:29:50,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:29:50,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:29:50,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:29:50,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:29:50,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:29:50,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:29:50,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:29:50,780 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:29:50,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:29:50,781 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:29:50,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:29:50,781 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:29:50,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:29:50,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:29:50,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:29:50,854 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:29:50,854 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:29:50,855 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl [2018-12-17 14:29:50,856 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl' [2018-12-17 14:29:50,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:29:50,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:29:50,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:29:50,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:29:50,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:29:50,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,941 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-17 14:29:50,941 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-17 14:29:50,942 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-17 14:29:50,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:29:50,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:29:50,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:29:50,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:29:50,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/1) ... [2018-12-17 14:29:50,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:29:50,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:29:50,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:29:50,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:29:50,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (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 [2018-12-17 14:29:51,040 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-17 14:29:51,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-17 14:29:51,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-17 14:29:51,449 INFO L272 CfgBuilder]: Using library mode [2018-12-17 14:29:51,449 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-17 14:29:51,450 INFO L202 PluginConnector]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:29:51 BoogieIcfgContainer [2018-12-17 14:29:51,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:29:51,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:29:51,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:29:51,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:29:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:29:50" (1/2) ... [2018-12-17 14:29:51,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285f5b45 and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:29:51, skipping insertion in model container [2018-12-17 14:29:51,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:29:51" (2/2) ... [2018-12-17 14:29:51,459 INFO L112 eAbstractionObserver]: Analyzing ICFG CountTillBound-Jupiter.bpl [2018-12-17 14:29:51,472 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:29:51,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-17 14:29:51,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-17 14:29:51,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:29:51,551 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:29:51,551 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:29:51,551 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:29:51,551 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:29:51,552 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:29:51,552 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:29:51,552 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:29:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-17 14:29:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-17 14:29:51,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:29:51,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-17 14:29:51,581 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:29:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:29:51,588 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-12-17 14:29:51,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:29:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:51,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:29:51,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:51,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:29:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:29:51,797 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} x := 0;y := 42; {12#(<= main_x 0)} is VALID [2018-12-17 14:29:51,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(<= main_x 0)} assume !(x < 100); {11#false} is VALID [2018-12-17 14:29:51,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} assume !(x == 100 && y == 42); {11#false} is VALID [2018-12-17 14:29:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:29:51,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:29:51,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-17 14:29:51,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:29:51,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-17 14:29:51,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:29:51,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:29:51,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:29:51,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:29:51,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:29:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:29:51,852 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-17 14:29:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:29:51,976 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-17 14:29:51,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:29:51,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-17 14:29:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:29:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:29:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-17 14:29:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:29:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-17 14:29:51,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2018-12-17 14:29:52,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:29:52,061 INFO L225 Difference]: With dead ends: 12 [2018-12-17 14:29:52,062 INFO L226 Difference]: Without dead ends: 6 [2018-12-17 14:29:52,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:29:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-17 14:29:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-17 14:29:52,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:29:52,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-17 14:29:52,096 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-17 14:29:52,096 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-17 14:29:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:29:52,098 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2018-12-17 14:29:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-17 14:29:52,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:29:52,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:29:52,099 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-17 14:29:52,099 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-17 14:29:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:29:52,101 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2018-12-17 14:29:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-17 14:29:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:29:52,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:29:52,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:29:52,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:29:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-17 14:29:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-17 14:29:52,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-17 14:29:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:29:52,106 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-17 14:29:52,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:29:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-17 14:29:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-17 14:29:52,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:29:52,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-17 14:29:52,107 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:29:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:29:52,108 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2018-12-17 14:29:52,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:29:52,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:52,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:29:52,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:29:52,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:29:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:29:52,507 INFO L273 TraceCheckUtils]: 0: Hoare triple {51#true} x := 0;y := 42; {53#(<= main_x 0)} is VALID [2018-12-17 14:29:52,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#(<= main_x 0)} assume x < 100;x := x + 1; {54#(<= main_x 1)} is VALID [2018-12-17 14:29:52,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {54#(<= main_x 1)} assume !(y <= 0); {54#(<= main_x 1)} is VALID [2018-12-17 14:29:52,553 INFO L273 TraceCheckUtils]: 3: Hoare triple {54#(<= main_x 1)} assume !(x < 100); {52#false} is VALID [2018-12-17 14:29:52,554 INFO L273 TraceCheckUtils]: 4: Hoare triple {52#false} assume !(x == 100 && y == 42); {52#false} is VALID [2018-12-17 14:29:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:29:52,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:29:52,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:29:52,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-17 14:29:52,558 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [13] [2018-12-17 14:29:52,628 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-17 14:29:52,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:29:54,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-17 14:29:54,008 INFO L272 AbstractInterpreter]: Visited 5 different actions 46 times. Merged at 2 different actions 27 times. Widened at 2 different actions 19 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-17 14:29:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:29:54,013 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-17 14:29:54,163 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-17 14:29:54,198 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-17 14:29:54,351 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-17 14:29:54,471 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-17 14:29:54,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-17 14:29:54,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2018-12-17 14:29:54,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:29:54,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-17 14:29:54,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:29:54,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-17 14:29:54,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:29:54,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-17 14:29:54,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-17 14:29:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-17 14:29:54,547 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 5 states. [2018-12-17 14:29:54,589 WARN L207 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-17 14:29:54,590 WARN L212 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-17 14:29:54,592 WARN L214 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-17 14:29:54,593 WARN L218 ngHoareTripleChecker]: -- [2018-12-17 14:29:54,594 WARN L219 ngHoareTripleChecker]: Pre: {103#(and (<= (- (- c_main_x) c_main_x) 0) (<= (- (- c_main_y) c_main_y) (- 84)) (<= (- (- c_main_x) (- c_main_y)) 42) (<= (- c_main_x (- c_main_y)) 142) (<= (- c_main_x (- c_main_x)) 200) (<= (- c_main_x c_main_y) 58) (<= (- c_main_y (- c_main_y)) 84) (<= (- (- c_main_x) c_main_y) (- 42)))} [2018-12-17 14:29:54,595 WARN L223 ngHoareTripleChecker]: Action: assume x < 100;x := x + 1; [2018-12-17 14:29:54,596 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) [2018-12-17 14:29:54,596 WARN L225 ngHoareTripleChecker]: Post: {104#false} [2018-12-17 14:29:54,596 WARN L235 ngHoareTripleChecker]: -- [2018-12-17 14:29:54,597 WARN L237 ngHoareTripleChecker]: unsat core generation is disabled, enable it to get more details [2018-12-17 14:29:54,602 FATAL L613 ntHoareTripleChecker]: Check was UNKNOWN but should have been INVALID [2018-12-17 14:29:54,602 FATAL L616 ntHoareTripleChecker]: PreS: {#1{Arrays: {}, Substate: {ints: {main_y = [42; 42]; main_x = [0; 100]}, relations: {main_x + main_y = [42; 200]; main_x - main_y = [-42; 84]}, }}} [2018-12-17 14:29:54,603 FATAL L621 ntHoareTripleChecker]: (and (< c_main_x 100) (= c_main_x_primed (+ c_main_x 1))) (assume x < 100;x := x + 1;) [2018-12-17 14:29:54,603 FATAL L622 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2018-12-17 14:29:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:29:54,605 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Invalid hoare triple check at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-17 14:29:54,615 INFO L168 Benchmark]: Toolchain (without parser) took 3712.18 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: 105.7 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2018-12-17 14:29:54,617 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 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. [2018-12-17 14:29:54,620 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.51 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. [2018-12-17 14:29:54,621 INFO L168 Benchmark]: Boogie Preprocessor took 22.33 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. [2018-12-17 14:29:54,622 INFO L168 Benchmark]: RCFGBuilder took 483.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-17 14:29:54,625 INFO L168 Benchmark]: TraceAbstraction took 3160.52 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-12-17 14:29:54,630 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.24 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 39.51 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 22.33 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 483.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3160.52 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: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Invalid hoare triple check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Invalid hoare triple check: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:254) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...