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/20170304-DifficultPathPrograms/sum_array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:33:59,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:33:59,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:33:59,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:33:59,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:33:59,516 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:33:59,517 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:33:59,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:33:59,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:33:59,524 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:33:59,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:33:59,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:33:59,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:33:59,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:33:59,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:33:59,533 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:33:59,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:33:59,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:33:59,538 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:33:59,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:33:59,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:33:59,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:33:59,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:33:59,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:33:59,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:33:59,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:33:59,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:33:59,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:33:59,548 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:33:59,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:33:59,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:33:59,550 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:33:59,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:33:59,551 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:33:59,552 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:33:59,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:33:59,553 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-02-28 13:33:59,566 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:33:59,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:33:59,567 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:33:59,567 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:33:59,567 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:33:59,567 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:33:59,568 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:33:59,568 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:33:59,568 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:33:59,568 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:33:59,568 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:33:59,568 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:33:59,569 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:33:59,569 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:33:59,570 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:33:59,570 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:33:59,570 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:33:59,570 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:33:59,570 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:33:59,570 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:33:59,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:33:59,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:33:59,571 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:33:59,571 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:33:59,571 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:33:59,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:33:59,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:33:59,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:33:59,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:33:59,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:33:59,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:59,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:33:59,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:33:59,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:33:59,573 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:33:59,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:33:59,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:33:59,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:33:59,574 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:33:59,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:33:59,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:33:59,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:33:59,619 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:33:59,620 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:33:59,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl [2019-02-28 13:33:59,620 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl' [2019-02-28 13:33:59,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:33:59,663 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:33:59,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:59,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:33:59,664 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:33:59,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:59,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:33:59,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:33:59,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:33:59,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/1) ... [2019-02-28 13:33:59,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:33:59,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:33:59,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:33:59,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:33:59,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:59,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:33:59,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:34:00,360 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:34:00,360 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-28 13:34:00,361 INFO L202 PluginConnector]: Adding new model sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:34:00 BoogieIcfgContainer [2019-02-28 13:34:00,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:34:00,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:34:00,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:34:00,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:34:00,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:59" (1/2) ... [2019-02-28 13:34:00,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72cb7222 and model type sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:34:00, skipping insertion in model container [2019-02-28 13:34:00,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:34:00" (2/2) ... [2019-02-28 13:34:00,370 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array.i_3.bpl [2019-02-28 13:34:00,379 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:34:00,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:34:00,405 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:34:00,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:34:00,439 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:34:00,439 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:34:00,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:34:00,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:34:00,439 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:34:00,440 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:34:00,440 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:34:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-28 13:34:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:34:00,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:34:00,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:34:00,466 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:34:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:34:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-02-28 13:34:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:34:00,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:34:00,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:34:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:34:00,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:34:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:34:00,790 INFO L273 TraceCheckUtils]: 0: Hoare triple {11#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {13#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-02-28 13:34:00,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} is VALID [2019-02-28 13:34:00,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} is VALID [2019-02-28 13:34:00,817 INFO L273 TraceCheckUtils]: 3: Hoare triple {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {12#false} is VALID [2019-02-28 13:34:00,818 INFO L273 TraceCheckUtils]: 4: Hoare triple {12#false} assume !false; {12#false} is VALID [2019-02-28 13:34:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:34:00,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:34:00,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:34:00,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:34:00,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:34:00,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:34:00,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:34:00,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:34:00,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:34:00,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:34:00,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:34:00,876 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-02-28 13:34:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:34:01,509 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-02-28 13:34:01,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:34:01,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:34:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:34:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:34:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-02-28 13:34:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:34:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-02-28 13:34:01,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2019-02-28 13:34:01,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:34:01,642 INFO L225 Difference]: With dead ends: 17 [2019-02-28 13:34:01,643 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 13:34:01,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:34:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 13:34:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 13:34:01,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:34:01,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-02-28 13:34:01,862 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-28 13:34:01,863 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-28 13:34:01,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:34:01,865 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-02-28 13:34:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-28 13:34:01,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:34:01,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:34:01,866 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-02-28 13:34:01,866 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-02-28 13:34:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:34:01,868 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-02-28 13:34:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-28 13:34:01,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:34:01,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:34:01,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:34:01,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:34:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 13:34:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-02-28 13:34:01,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2019-02-28 13:34:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:34:01,876 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-02-28 13:34:01,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:34:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-02-28 13:34:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 13:34:01,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:34:01,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 13:34:01,879 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:34:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:34:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash 266557342, now seen corresponding path program 1 times [2019-02-28 13:34:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:34:01,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:34:01,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:34:01,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:34:01,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:34:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:34:02,778 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2019-02-28 13:34:02,994 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-02-28 13:34:02,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {82#true} is VALID [2019-02-28 13:34:02,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {82#true} is VALID [2019-02-28 13:34:02,995 INFO L273 TraceCheckUtils]: 3: Hoare triple {82#true} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~B~6 := main_~B~6[main_~i~6 % 4294967296 := main_#t~nondet4];havoc main_#t~nondet4;assume !!(main_~B~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 + 1;havoc main_#t~post3; {82#true} is VALID [2019-02-28 13:34:02,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} is VALID [2019-02-28 13:34:03,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~C~6 := main_~C~6[main_~i~6 % 4294967296 := main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296]];main_#t~post5 := main_~i~6;main_~i~6 := main_#t~post5 + 1;havoc main_#t~post5; {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} is VALID [2019-02-28 13:34:03,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {83#false} is VALID [2019-02-28 13:34:03,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {83#false} assume !false; {83#false} is VALID [2019-02-28 13:34:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 13:34:03,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:34:03,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:34:03,007 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 13:34:03,009 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [19], [21], [23] [2019-02-28 13:34:03,067 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:34:03,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:34:03,330 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-28 13:34:11,170 FATAL L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:34:11,170 FATAL L217 ngHoareTripleChecker]: Expected: VALID Actual: INVALID [2019-02-28 13:34:11,171 FATAL L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:34:11,172 FATAL L223 ngHoareTripleChecker]: -- [2019-02-28 13:34:11,172 FATAL L224 ngHoareTripleChecker]: Pre: {2147483625#(or (forall ((v_idx_113 Int)) (and (<= (- (- c_ULTIMATE.start_main_~i~6) c_ULTIMATE.start_main_~i~6) 0) (<= (- c_ULTIMATE.start_main_~i~6 (- c_ULTIMATE.start_main_~i~6)) 2) (<= 0 (* 2 c_ULTIMATE.start_main_~i~6)) (<= c_ULTIMATE.start_main_~i~6 1) (<= 0 c_ULTIMATE.start_main_~i~6) (<= (* 2 c_ULTIMATE.start_main_~i~6) 2) (or (< v_idx_113 0) (<= c_ULTIMATE.start_main_~i~6 v_idx_113) (and (<= (select c_ULTIMATE.start_main_~A~6 v_idx_113) (+ c_ULTIMATE.start_main_~i~6 1000000)) (<= (select c_ULTIMATE.start_main_~A~6 v_idx_113) 1000000) (<= (* 2 (select c_ULTIMATE.start_main_~A~6 v_idx_113)) 2000000) (<= (+ c_ULTIMATE.start_main_~i~6 (select c_ULTIMATE.start_main_~A~6 v_idx_113)) 1000001) (<= (+ (select c_ULTIMATE.start_main_~A~6 v_idx_113) c_ULTIMATE.start_main_~i~6) 1000001))))) (forall ((v_idx_108 Int)) (and (<= (- (- c_ULTIMATE.start_main_~i~6) c_ULTIMATE.start_main_~i~6) (- 4)) (<= 4 (* 2 c_ULTIMATE.start_main_~i~6)) (<= (- c_ULTIMATE.start_main_~i~6 (- c_ULTIMATE.start_main_~i~6)) 4) (<= (* 2 c_ULTIMATE.start_main_~i~6) 4) (or (and (<= (select c_ULTIMATE.start_main_~A~6 v_idx_108) (+ c_ULTIMATE.start_main_~i~6 999998)) (<= (* 2 (select c_ULTIMATE.start_main_~A~6 v_idx_108)) 2000000) (<= (+ c_ULTIMATE.start_main_~i~6 (select c_ULTIMATE.start_main_~A~6 v_idx_108)) 1000002)) (< (+ v_idx_108 c_ULTIMATE.start_main_~i~6) 3) (<= c_ULTIMATE.start_main_~i~6 v_idx_108)))))} [2019-02-28 13:34:11,172 FATAL L228 ngHoareTripleChecker]: Action: assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; [2019-02-28 13:34:11,173 FATAL L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (< (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod c_ULTIMATE.start_main_~M~6 4294967296))) (= c_ULTIMATE.start_main_~i~6_primed 0)) [2019-02-28 13:34:11,173 FATAL L230 ngHoareTripleChecker]: Post: {2147483624#(forall ((v_idx_118 Int)) (and (<= (- (- c_ULTIMATE.start_main_~i~6) c_ULTIMATE.start_main_~i~6) 0) (<= 0 (* 2 c_ULTIMATE.start_main_~i~6)) (<= (* 2 c_ULTIMATE.start_main_~i~6) 0) (or (<= (+ c_ULTIMATE.start_main_~i~6 2) v_idx_118) (and (<= (* 2 (select c_ULTIMATE.start_main_~A~6 v_idx_118)) 2000000) (<= (+ (select c_ULTIMATE.start_main_~A~6 v_idx_118) c_ULTIMATE.start_main_~i~6) 1000000) (<= (select c_ULTIMATE.start_main_~A~6 v_idx_118) (+ c_ULTIMATE.start_main_~i~6 1000000))) (< (+ v_idx_118 c_ULTIMATE.start_main_~i~6) 1)) (<= (- c_ULTIMATE.start_main_~i~6 (- c_ULTIMATE.start_main_~i~6)) 0)))} [2019-02-28 13:34:11,174 FATAL L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:34:11,180 FATAL L268 ngHoareTripleChecker]: -- [2019-02-28 13:34:11,180 FATAL L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:34:11,205 FATAL L270 ngHoareTripleChecker]: Pre: {2147483625#(or (forall ((v_idx_113 Int)) (and (<= (- (- ULTIMATE.start_main_~i~6) ULTIMATE.start_main_~i~6) 0) (<= (- ULTIMATE.start_main_~i~6 (- ULTIMATE.start_main_~i~6)) 2) (<= 0 (* 2 ULTIMATE.start_main_~i~6)) (<= ULTIMATE.start_main_~i~6 1) (<= 0 ULTIMATE.start_main_~i~6) (<= (* 2 ULTIMATE.start_main_~i~6) 2) (or (< v_idx_113 0) (<= ULTIMATE.start_main_~i~6 v_idx_113) (and (<= (select ULTIMATE.start_main_~A~6 v_idx_113) (+ ULTIMATE.start_main_~i~6 1000000)) (<= (select ULTIMATE.start_main_~A~6 v_idx_113) 1000000) (<= (* 2 (select ULTIMATE.start_main_~A~6 v_idx_113)) 2000000) (<= (+ ULTIMATE.start_main_~i~6 (select ULTIMATE.start_main_~A~6 v_idx_113)) 1000001) (<= (+ (select ULTIMATE.start_main_~A~6 v_idx_113) ULTIMATE.start_main_~i~6) 1000001))))) (forall ((v_idx_108 Int)) (and (<= (- (- ULTIMATE.start_main_~i~6) ULTIMATE.start_main_~i~6) (- 4)) (<= 4 (* 2 ULTIMATE.start_main_~i~6)) (<= (- ULTIMATE.start_main_~i~6 (- ULTIMATE.start_main_~i~6)) 4) (<= (* 2 ULTIMATE.start_main_~i~6) 4) (or (and (<= (select ULTIMATE.start_main_~A~6 v_idx_108) (+ ULTIMATE.start_main_~i~6 999998)) (<= (* 2 (select ULTIMATE.start_main_~A~6 v_idx_108)) 2000000) (<= (+ ULTIMATE.start_main_~i~6 (select ULTIMATE.start_main_~A~6 v_idx_108)) 1000002)) (< (+ v_idx_108 ULTIMATE.start_main_~i~6) 3) (<= ULTIMATE.start_main_~i~6 v_idx_108)))))} [2019-02-28 13:34:11,206 FATAL L274 ngHoareTripleChecker]: Action: assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; [2019-02-28 13:34:11,207 FATAL L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (< (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod c_ULTIMATE.start_main_~M~6 4294967296))) (= c_ULTIMATE.start_main_~i~6_primed 0)) [2019-02-28 13:34:11,672 FATAL L276 ngHoareTripleChecker]: Post: {2147483624#(and (forall ((v_idx_118 Int)) (or (<= (* 2 (select ULTIMATE.start_main_~A~6 v_idx_118)) 2000000) (<= (+ ULTIMATE.start_main_~i~6 2) v_idx_118) (< (+ v_idx_118 ULTIMATE.start_main_~i~6) 1))) (<= (- (- ULTIMATE.start_main_~i~6) ULTIMATE.start_main_~i~6) 0) (<= 0 (* 2 ULTIMATE.start_main_~i~6)) (<= (* 2 ULTIMATE.start_main_~i~6) 0) (<= (- ULTIMATE.start_main_~i~6 (- ULTIMATE.start_main_~i~6)) 0) (forall ((v_prenex_2 Int)) (or (< (+ v_prenex_2 ULTIMATE.start_main_~i~6) 1) (<= (select ULTIMATE.start_main_~A~6 v_prenex_2) (+ ULTIMATE.start_main_~i~6 1000000)) (<= (+ ULTIMATE.start_main_~i~6 2) v_prenex_2))) (forall ((v_prenex_1 Int)) (or (<= (+ ULTIMATE.start_main_~i~6 2) v_prenex_1) (< (+ v_prenex_1 ULTIMATE.start_main_~i~6) 1) (<= (+ (select ULTIMATE.start_main_~A~6 v_prenex_1) ULTIMATE.start_main_~i~6) 1000000))))} [2019-02-28 13:34:11,673 FATAL L272 FixpointEngine]: Post is unsound because the term-transformation of the following triple is not valid: [2019-02-28 13:34:11,675 FATAL L273 FixpointEngine]: PreBL : #2{Arrays: {[ULTIMATE.start_main_~A~6] -> [-inf_0] v_58 [b_14] v_59 [b_15] v_60 [inf_0], [ULTIMATE.start_main_~B~6] -> [-inf_0] v_7 [inf_0], [ULTIMATE.start_main_~C~6] -> [-inf_0] v_8 [inf_0], }, Substate: {ints: {ULTIMATE.start_main_~i~6 = [2; 2]; v_59 = [-inf; 1000000]; b_14 = [1; 1]; b_15 = [2; 2]}, 15 vars top, relations: {ULTIMATE.start_main_~i~6 + v_59 = [-inf; 1000002]; ULTIMATE.start_main_~i~6 - v_59 = [-999998; inf]; b_14 + v_59 = [-inf; 1000001]; b_14 - v_59 = [-999999; inf]; b_15 + v_59 = [-inf; 1000002]; b_15 - v_59 = [-999998; inf]; ULTIMATE.start_main_~i~6 + b_14 = [3; 3]; ULTIMATE.start_main_~i~6 - b_14 = [1; 1]; ULTIMATE.start_main_~i~6 + b_15 = [4; 4]; ULTIMATE.start_main_~i~6 - b_15 = [0; 0]; b_14 + b_15 = [3; 3]; b_14 - b_15 = [-1; -1]}, }}, {Arrays: {[ULTIMATE.start_main_~A~6] -> [-inf_0] v_215 [b_16] v_218 [b_17] v_217 [inf_0], [ULTIMATE.start_main_~B~6] -> [-inf_0] v_213 [inf_0], [ULTIMATE.start_main_~C~6] -> [-inf_0] v_214 [inf_0], }, Substate: {ints: {ULTIMATE.start_main_~i~6 = [0; 1]; v_218 = [-inf; 1000000]; b_17 = [0; 1]; b_16 = [0; 0]}, 15 vars top, relations: {ULTIMATE.start_main_~i~6 + v_218 = [-inf; 1000001]; ULTIMATE.start_main_~i~6 - v_218 = [-1000000; inf]; b_17 + v_218 = [-inf; 1000001]; b_17 - v_218 = [-1000000; inf]; b_16 + v_218 = [-inf; 1000000]; b_16 - v_218 = [-1000000; inf]; ULTIMATE.start_main_~i~6 + b_17 = [0; 2]; ULTIMATE.start_main_~i~6 - b_17 = [0; 0]; b_16 + b_17 = [0; 1]; b_16 - b_17 = [-1; 0]; ULTIMATE.start_main_~i~6 + b_16 = [0; 1]; ULTIMATE.start_main_~i~6 - b_16 = [0; 1]}, }} [2019-02-28 13:34:11,676 FATAL L274 FixpointEngine]: PreH : #1{Arrays: {[ULTIMATE.start_main_~A~6] -> [-inf_0] v_2 [inf_0], [ULTIMATE.start_main_~B~6] -> [-inf_0] v_0 [inf_0], [ULTIMATE.start_main_~C~6] -> [-inf_0] v_1 [inf_0], }, Substate: {15 vars top, }} [2019-02-28 13:34:11,677 FATAL L278 FixpointEngine]: Action: assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; (to ULTIMATE.start) [2019-02-28 13:34:11,677 FATAL L282 FixpointEngine]: Post : #1{Arrays: {[ULTIMATE.start_main_~A~6] -> [-inf_0] v_58 [b_14] v_59 [b_15] v_60 [inf_0], [ULTIMATE.start_main_~B~6] -> [-inf_0] v_7 [inf_0], [ULTIMATE.start_main_~C~6] -> [-inf_0] v_8 [inf_0], }, Substate: {ints: {ULTIMATE.start_main_~i~6 = [0; 0]; v_59 = [-inf; 1000000]; b_14 = [1; 1]; b_15 = [2; 2]}, 15 vars top, relations: {b_14 + v_59 = [-inf; 1000001]; b_14 - v_59 = [-999999; inf]; b_15 + v_59 = [-inf; 1000002]; b_15 - v_59 = [-999998; inf]; b_14 + b_15 = [3; 3]; b_14 - b_15 = [-1; -1]}, }} [2019-02-28 13:34:11,679 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Post is unsound at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:255) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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) [2019-02-28 13:34:11,684 INFO L168 Benchmark]: Toolchain (without parser) took 12021.63 ms. Allocated memory was 139.5 MB in the beginning and 325.1 MB in the end (delta: 185.6 MB). Free memory was 105.6 MB in the beginning and 242.3 MB in the end (delta: -136.6 MB). Peak memory consumption was 205.5 MB. Max. memory is 7.1 GB. [2019-02-28 13:34:11,685 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 ms. Allocated memory is still 139.5 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:34:11,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.70 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 103.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-28 13:34:11,687 INFO L168 Benchmark]: Boogie Preprocessor took 26.65 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 102.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:34:11,688 INFO L168 Benchmark]: RCFGBuilder took 629.44 ms. Allocated memory is still 139.5 MB. Free memory was 102.6 MB in the beginning and 88.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-02-28 13:34:11,689 INFO L168 Benchmark]: TraceAbstraction took 11319.83 ms. Allocated memory was 139.5 MB in the beginning and 325.1 MB in the end (delta: 185.6 MB). Free memory was 88.5 MB in the beginning and 242.3 MB in the end (delta: -153.8 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. [2019-02-28 13:34:11,695 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.14 ms. Allocated memory is still 139.5 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.70 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 103.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.65 ms. Allocated memory is still 139.5 MB. Free memory was 103.7 MB in the beginning and 102.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 629.44 ms. Allocated memory is still 139.5 MB. Free memory was 102.6 MB in the beginning and 88.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11319.83 ms. Allocated memory was 139.5 MB in the beginning and 325.1 MB in the end (delta: 185.6 MB). Free memory was 88.5 MB in the beginning and 242.3 MB in the end (delta: -153.8 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Post is unsound de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Post is unsound: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:255) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...