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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:12:16,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:12:16,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:12:16,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:12:16,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:12:16,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:12:16,476 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:12:16,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:12:16,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:12:16,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:12:16,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:12:16,483 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:12:16,484 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:12:16,485 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:12:16,486 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:12:16,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:12:16,488 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:12:16,490 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:12:16,493 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:12:16,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:12:16,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:12:16,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:12:16,500 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:12:16,501 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:12:16,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:12:16,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:12:16,503 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:12:16,504 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:12:16,505 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:12:16,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:12:16,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:12:16,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:12:16,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:12:16,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:12:16,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:12:16,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:12:16,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-17 14:12:16,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:12:16,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:12:16,534 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:12:16,534 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:12:16,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:12:16,534 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:12:16,537 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:12:16,537 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-17 14:12:16,538 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:12:16,538 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-17 14:12:16,538 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-17 14:12:16,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:12:16,539 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:12:16,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:12:16,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:12:16,541 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:12:16,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:12:16,541 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:12:16,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:12:16,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:12:16,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:12:16,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:12:16,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:12:16,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:12:16,544 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:12:16,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:12:16,545 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:12:16,545 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:12:16,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:12:16,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:12:16,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:12:16,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:12:16,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:12:16,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:12:16,548 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:12:16,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:12:16,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:12:16,548 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:12:16,548 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:12:16,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:12:16,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:12:16,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:12:16,613 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:12:16,613 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:12:16,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2018-12-17 14:12:16,615 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2018-12-17 14:12:16,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:12:16,709 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:12:16,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:16,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:12:16,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:12:16,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:16,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:12:16,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:12:16,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:12:16,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:12:16,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:12:16,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:12:16,808 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:12:16,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (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:12:16,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-17 14:12:16,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-17 14:12:17,580 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-17 14:12:17,580 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-17 14:12:17,583 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:17 BoogieIcfgContainer [2018-12-17 14:12:17,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:12:17,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:12:17,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:12:17,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:12:17,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/2) ... [2018-12-17 14:12:17,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bccfd5 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:17, skipping insertion in model container [2018-12-17 14:12:17,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:17" (2/2) ... [2018-12-17 14:12:17,591 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2018-12-17 14:12:17,602 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:12:17,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-17 14:12:17,629 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-17 14:12:17,665 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:12:17,666 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:12:17,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:12:17,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:12:17,666 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:12:17,666 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:12:17,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:12:17,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:12:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-17 14:12:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-17 14:12:17,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:17,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-17 14:12:17,693 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:17,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:17,700 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2018-12-17 14:12:17,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:17,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:18,028 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~post0, main_#t~post2, main_#t~post1, main_#t~post3, main_#t~post4, main_~nodecount~4, main_~edgecount~4, main_~source~4, main_~Source~4, main_~Dest~4, main_~Weight~4, main_~distance~4, main_~x~4, main_~y~4, main_~i~4, main_~j~4;main_~nodecount~4 := 5;main_~edgecount~4 := 20;main_~source~4 := 0;main_~Source~4 := main_~Source~4[0 := 0];main_~Source~4 := main_~Source~4[1 := 4];main_~Source~4 := main_~Source~4[2 := 1];main_~Source~4 := main_~Source~4[3 := 1];main_~Source~4 := main_~Source~4[4 := 0];main_~Source~4 := main_~Source~4[5 := 0];main_~Source~4 := main_~Source~4[6 := 1];main_~Source~4 := main_~Source~4[7 := 3];main_~Source~4 := main_~Source~4[8 := 4];main_~Source~4 := main_~Source~4[9 := 4];main_~Source~4 := main_~Source~4[10 := 2];main_~Source~4 := main_~Source~4[11 := 2];main_~Source~4 := main_~Source~4[12 := 3];main_~Source~4 := main_~Source~4[13 := 0];main_~Source~4 := main_~Source~4[14 := 0];main_~Source~4 := main_~Source~4[15 := 3];main_~Source~4 := main_~Source~4[16 := 1];main_~Source~4 := main_~Source~4[17 := 2];main_~Source~4 := main_~Source~4[18 := 2];main_~Source~4 := main_~Source~4[19 := 3];main_~Dest~4 := main_~Dest~4[0 := 1];main_~Dest~4 := main_~Dest~4[1 := 3];main_~Dest~4 := main_~Dest~4[2 := 4];main_~Dest~4 := main_~Dest~4[3 := 1];main_~Dest~4 := main_~Dest~4[4 := 1];main_~Dest~4 := main_~Dest~4[5 := 4];main_~Dest~4 := main_~Dest~4[6 := 3];main_~Dest~4 := main_~Dest~4[7 := 4];main_~Dest~4 := main_~Dest~4[8 := 3];main_~Dest~4 := main_~Dest~4[9 := 0];main_~Dest~4 := main_~Dest~4[10 := 0];main_~Dest~4 := main_~Dest~4[11 := 0];main_~Dest~4 := main_~Dest~4[12 := 0];main_~Dest~4 := main_~Dest~4[13 := 2];main_~Dest~4 := main_~Dest~4[14 := 3];main_~Dest~4 := main_~Dest~4[15 := 0];main_~Dest~4 := main_~Dest~4[16 := 2];main_~Dest~4 := main_~Dest~4[17 := 1];main_~Dest~4 := main_~Dest~4[18 := 0];main_~Dest~4 := main_~Dest~4[19 := 4];main_~Weight~4 := main_~Weight~4[0 := 0];main_~Weight~4 := main_~Weight~4[1 := 1];main_~Weight~4 := main_~Weight~4[2 := 2];main_~Weight~4 := main_~Weight~4[3 := 3];main_~Weight~4 := main_~Weight~4[4 := 4];main_~Weight~4 := main_~Weight~4[5 := 5];main_~Weight~4 := main_~Weight~4[6 := 6];main_~Weight~4 := main_~Weight~4[7 := 7];main_~Weight~4 := main_~Weight~4[8 := 8];main_~Weight~4 := main_~Weight~4[9 := 9];main_~Weight~4 := main_~Weight~4[10 := 10];main_~Weight~4 := main_~Weight~4[11 := 11];main_~Weight~4 := main_~Weight~4[12 := 12];main_~Weight~4 := main_~Weight~4[13 := 13];main_~Weight~4 := main_~Weight~4[14 := 14];main_~Weight~4 := main_~Weight~4[15 := 15];main_~Weight~4 := main_~Weight~4[16 := 16];main_~Weight~4 := main_~Weight~4[17 := 17];main_~Weight~4 := main_~Weight~4[18 := 18];main_~Weight~4 := main_~Weight~4[19 := 19];havoc main_~distance~4;havoc main_~x~4;havoc main_~y~4;havoc main_~i~4;havoc main_~j~4;main_~i~4 := 0; {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2018-12-17 14:12:18,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2018-12-17 14:12:18,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {14#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {15#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} is VALID [2018-12-17 14:12:18,071 INFO L273 TraceCheckUtils]: 3: Hoare triple {15#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} assume !(main_~i~4 < main_~edgecount~4);main_~i~4 := 0;assume !!(main_~i~4 < main_~nodecount~4);__VERIFIER_assert_#in~cond := (if main_~distance~4[main_~i~4] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {13#false} is VALID [2018-12-17 14:12:18,071 INFO L273 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2018-12-17 14:12:18,074 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:12:18,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:18,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-17 14:12:18,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:18,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-17 14:12:18,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:18,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-17 14:12:18,126 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:12:18,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-17 14:12:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-17 14:12:18,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-17 14:12:18,138 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-12-17 14:12:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,590 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2018-12-17 14:12:18,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-17 14:12:18,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-17 14:12:18,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:12:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-12-17 14:12:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:12:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-12-17 14:12:18,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2018-12-17 14:12:18,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:18,756 INFO L225 Difference]: With dead ends: 15 [2018-12-17 14:12:18,756 INFO L226 Difference]: Without dead ends: 11 [2018-12-17 14:12:18,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-17 14:12:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-17 14:12:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-12-17 14:12:18,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:18,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 8 states. [2018-12-17 14:12:18,888 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 8 states. [2018-12-17 14:12:18,888 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 8 states. [2018-12-17 14:12:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,892 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-17 14:12:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2018-12-17 14:12:18,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:18,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:18,893 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 11 states. [2018-12-17 14:12:18,893 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 11 states. [2018-12-17 14:12:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,896 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-17 14:12:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2018-12-17 14:12:18,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:18,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:18,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:18,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-17 14:12:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-12-17 14:12:18,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2018-12-17 14:12:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:18,901 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-12-17 14:12:18,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-17 14:12:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2018-12-17 14:12:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-17 14:12:18,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:18,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-17 14:12:18,905 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2018-12-17 14:12:18,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:18,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:19,198 INFO L273 TraceCheckUtils]: 0: Hoare triple {79#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~post0, main_#t~post2, main_#t~post1, main_#t~post3, main_#t~post4, main_~nodecount~4, main_~edgecount~4, main_~source~4, main_~Source~4, main_~Dest~4, main_~Weight~4, main_~distance~4, main_~x~4, main_~y~4, main_~i~4, main_~j~4;main_~nodecount~4 := 5;main_~edgecount~4 := 20;main_~source~4 := 0;main_~Source~4 := main_~Source~4[0 := 0];main_~Source~4 := main_~Source~4[1 := 4];main_~Source~4 := main_~Source~4[2 := 1];main_~Source~4 := main_~Source~4[3 := 1];main_~Source~4 := main_~Source~4[4 := 0];main_~Source~4 := main_~Source~4[5 := 0];main_~Source~4 := main_~Source~4[6 := 1];main_~Source~4 := main_~Source~4[7 := 3];main_~Source~4 := main_~Source~4[8 := 4];main_~Source~4 := main_~Source~4[9 := 4];main_~Source~4 := main_~Source~4[10 := 2];main_~Source~4 := main_~Source~4[11 := 2];main_~Source~4 := main_~Source~4[12 := 3];main_~Source~4 := main_~Source~4[13 := 0];main_~Source~4 := main_~Source~4[14 := 0];main_~Source~4 := main_~Source~4[15 := 3];main_~Source~4 := main_~Source~4[16 := 1];main_~Source~4 := main_~Source~4[17 := 2];main_~Source~4 := main_~Source~4[18 := 2];main_~Source~4 := main_~Source~4[19 := 3];main_~Dest~4 := main_~Dest~4[0 := 1];main_~Dest~4 := main_~Dest~4[1 := 3];main_~Dest~4 := main_~Dest~4[2 := 4];main_~Dest~4 := main_~Dest~4[3 := 1];main_~Dest~4 := main_~Dest~4[4 := 1];main_~Dest~4 := main_~Dest~4[5 := 4];main_~Dest~4 := main_~Dest~4[6 := 3];main_~Dest~4 := main_~Dest~4[7 := 4];main_~Dest~4 := main_~Dest~4[8 := 3];main_~Dest~4 := main_~Dest~4[9 := 0];main_~Dest~4 := main_~Dest~4[10 := 0];main_~Dest~4 := main_~Dest~4[11 := 0];main_~Dest~4 := main_~Dest~4[12 := 0];main_~Dest~4 := main_~Dest~4[13 := 2];main_~Dest~4 := main_~Dest~4[14 := 3];main_~Dest~4 := main_~Dest~4[15 := 0];main_~Dest~4 := main_~Dest~4[16 := 2];main_~Dest~4 := main_~Dest~4[17 := 1];main_~Dest~4 := main_~Dest~4[18 := 0];main_~Dest~4 := main_~Dest~4[19 := 4];main_~Weight~4 := main_~Weight~4[0 := 0];main_~Weight~4 := main_~Weight~4[1 := 1];main_~Weight~4 := main_~Weight~4[2 := 2];main_~Weight~4 := main_~Weight~4[3 := 3];main_~Weight~4 := main_~Weight~4[4 := 4];main_~Weight~4 := main_~Weight~4[5 := 5];main_~Weight~4 := main_~Weight~4[6 := 6];main_~Weight~4 := main_~Weight~4[7 := 7];main_~Weight~4 := main_~Weight~4[8 := 8];main_~Weight~4 := main_~Weight~4[9 := 9];main_~Weight~4 := main_~Weight~4[10 := 10];main_~Weight~4 := main_~Weight~4[11 := 11];main_~Weight~4 := main_~Weight~4[12 := 12];main_~Weight~4 := main_~Weight~4[13 := 13];main_~Weight~4 := main_~Weight~4[14 := 14];main_~Weight~4 := main_~Weight~4[15 := 15];main_~Weight~4 := main_~Weight~4[16 := 16];main_~Weight~4 := main_~Weight~4[17 := 17];main_~Weight~4 := main_~Weight~4[18 := 18];main_~Weight~4 := main_~Weight~4[19 := 19];havoc main_~distance~4;havoc main_~x~4;havoc main_~y~4;havoc main_~i~4;havoc main_~j~4;main_~i~4 := 0; {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2018-12-17 14:12:19,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} is VALID [2018-12-17 14:12:19,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {81#(<= 20 ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~nodecount~4);main_~i~4 := 0; {82#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} is VALID [2018-12-17 14:12:19,234 INFO L273 TraceCheckUtils]: 3: Hoare triple {82#(and (<= 20 ULTIMATE.start_main_~edgecount~4) (= ULTIMATE.start_main_~i~4 0))} assume !!(main_~i~4 < main_~edgecount~4);main_~x~4 := main_~Dest~4[main_~i~4];main_~y~4 := main_~Source~4[main_~i~4];assume !(main_~distance~4[main_~x~4] > main_~distance~4[main_~y~4] + main_~Weight~4[main_~i~4]);main_#t~post3 := main_~i~4;main_~i~4 := main_#t~post3 + 1;havoc main_#t~post3; {83#(<= (+ ULTIMATE.start_main_~i~4 19) ULTIMATE.start_main_~edgecount~4)} is VALID [2018-12-17 14:12:19,236 INFO L273 TraceCheckUtils]: 4: Hoare triple {83#(<= (+ ULTIMATE.start_main_~i~4 19) ULTIMATE.start_main_~edgecount~4)} assume !(main_~i~4 < main_~edgecount~4);main_~i~4 := 0;assume !!(main_~i~4 < main_~nodecount~4);__VERIFIER_assert_#in~cond := (if main_~distance~4[main_~i~4] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {80#false} is VALID [2018-12-17 14:12:19,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {80#false} assume !false; {80#false} is VALID [2018-12-17 14:12:19,237 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:12:19,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:12:19,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:12:19,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-17 14:12:19,240 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2018-12-17 14:12:19,278 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-17 14:12:19,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:12:19,387 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-17 14:12:19,389 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 131 root evaluator evaluations with a maximum evaluation depth of 3. Performed 131 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 0 variables. [2018-12-17 14:12:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:19,394 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-17 14:12:19,522 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 40% of their original sizes. [2018-12-17 14:12:19,545 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-17 14:12:19,597 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2018-12-17 14:12:19,632 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-17 14:12:19,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-17 14:12:19,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2018-12-17 14:12:19,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:19,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-12-17 14:12:19,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:19,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:19,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:19,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:19,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:19,698 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2018-12-17 14:12:19,735 WARN L207 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-17 14:12:19,736 WARN L212 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-17 14:12:19,737 WARN L214 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-17 14:12:19,738 WARN L218 ngHoareTripleChecker]: -- [2018-12-17 14:12:19,738 WARN L219 ngHoareTripleChecker]: Pre: {129#(and (= c_ULTIMATE.start_main_~edgecount~4 20) (= c_ULTIMATE.start_main_~nodecount~4 5) (= c_ULTIMATE.start_main_~i~4 0))} [2018-12-17 14:12:19,739 WARN L223 ngHoareTripleChecker]: Action: assume !!(main_~i~4 < main_~nodecount~4);assume !(main_~i~4 == main_~source~4);main_~distance~4 := main_~distance~4[main_~i~4 := ~INFINITY];main_#t~post0 := main_~i~4;main_~i~4 := main_#t~post0 + 1;havoc main_#t~post0; [2018-12-17 14:12:19,740 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4 c_~INFINITY))) [2018-12-17 14:12:19,740 WARN L225 ngHoareTripleChecker]: Post: {130#false} [2018-12-17 14:12:19,740 WARN L235 ngHoareTripleChecker]: -- [2018-12-17 14:12:19,740 WARN L237 ngHoareTripleChecker]: unsat core generation is disabled, enable it to get more details [2018-12-17 14:12:19,741 FATAL L613 ntHoareTripleChecker]: Check was UNKNOWN but should have been INVALID [2018-12-17 14:12:19,742 FATAL L616 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~i~4 = 0; ULTIMATE.start_main_~nodecount~4 = 5; TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , Exp: ULTIMATE.start_main_~edgecount~4 = 20; ULTIMATE.start_main_~i~4 = 0; ULTIMATE.start_main_~nodecount~4 = 5; TOP: ~INFINITY, old(~INFINITY), ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_~source~4, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~x~4, ULTIMATE.start_main_#t~post1, ULTIMATE.start_main_#t~post0, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_~Weight~4, ULTIMATE.start_main_~j~4, ULTIMATE.start_main_#res, ULTIMATE.start_main_~Source~4, ULTIMATE.start_main_~distance~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_main_~y~4, ULTIMATE.start_main_~Dest~4 , }} [2018-12-17 14:12:19,742 FATAL L621 ntHoareTripleChecker]: (and (not (= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (= (+ c_ULTIMATE.start_main_~i~4 1) c_ULTIMATE.start_main_~i~4_primed) (< c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~distance~4_primed (store c_ULTIMATE.start_main_~distance~4 c_ULTIMATE.start_main_~i~4 c_~INFINITY))) (assume !!(main_~i~4 < main_~nodecount~4);assume !(main_~i~4 == main_~source~4);main_~distance~4 := main_~distance~4[main_~i~4 := ~INFINITY];main_#t~post0 := main_~i~4;main_~i~4 := main_#t~post0 + 1;havoc main_#t~post0;) [2018-12-17 14:12:19,742 FATAL L622 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-17 14:12:19,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:19,744 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:12:19,750 INFO L168 Benchmark]: Toolchain (without parser) took 3041.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 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:12:19,752 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:19,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:19,753 INFO L168 Benchmark]: Boogie Preprocessor took 49.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:19,754 INFO L168 Benchmark]: RCFGBuilder took 775.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:19,755 INFO L168 Benchmark]: TraceAbstraction took 2164.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:19,759 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.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 775.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2164.06 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 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...