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_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:12:16,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:12:16,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:12:16,418 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:12:16,418 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:12:16,419 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:12:16,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:12:16,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:12:16,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:12:16,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:12:16,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:12:16,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:12:16,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:12:16,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:12:16,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:12:16,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:12:16,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:12:16,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:12:16,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:12:16,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:12:16,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:12:16,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:12:16,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:12:16,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:12:16,460 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:12:16,461 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:12:16,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:12:16,466 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:12:16,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:12:16,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:12:16,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:12:16,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:12:16,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:12:16,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:12:16,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:12:16,476 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:12:16,476 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,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:12:16,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:12:16,504 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:12:16,504 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:12:16,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:12:16,505 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:12:16,505 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:12:16,505 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-17 14:12:16,505 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:12:16,505 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-17 14:12:16,506 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-17 14:12:16,506 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:12:16,506 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:12:16,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:12:16,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:12:16,507 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:12:16,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:12:16,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:12:16,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:12:16,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:12:16,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:12:16,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:12:16,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:12:16,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:12:16,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:12:16,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:12:16,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:12:16,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:12:16,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:12:16,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:12:16,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:12:16,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:12:16,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:12:16,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:12:16,511 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:12:16,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:12:16,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:12:16,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:12:16,512 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:12:16,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:12:16,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:12:16,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:12:16,602 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:12:16,603 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:12:16,604 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl [2018-12-17 14:12:16,604 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl' [2018-12-17 14:12:16,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:12:16,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:12:16,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:16,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:12:16,677 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:12:16,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:16,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:12:16,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:12:16,723 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:12:16,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_01.i_3.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 UnstructureCode from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/1) ... [2018-12-17 14:12:16,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:12:16,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:12:16,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:12:16,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:12:16,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_3.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,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-17 14:12:16,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-17 14:12:17,597 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-17 14:12:17,597 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-17 14:12:17,598 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:17 BoogieIcfgContainer [2018-12-17 14:12:17,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:12:17,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:12:17,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:12:17,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:12:17,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:16" (1/2) ... [2018-12-17 14:12:17,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e7987f and model type eureka_01.i_3.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,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:17" (2/2) ... [2018-12-17 14:12:17,606 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_3.bpl [2018-12-17 14:12:17,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:12:17,626 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-17 14:12:17,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-17 14:12:17,680 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:12:17,681 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:12:17,681 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:12:17,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:12:17,681 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:12:17,681 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:12:17,681 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:12:17,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:12:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-17 14:12:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-17 14:12:17,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:17,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-17 14:12:17,723 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-17 14:12:17,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:17,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:17,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:18,013 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post4, main_#t~post3, main_#t~post5, main_#t~post6, main_~nodecount~5, main_~edgecount~5, main_~source~5, main_~Source~5, main_~Dest~5, main_~Weight~5, main_~distance~5, main_~x~5, main_~y~5, main_~i~5, main_~j~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~nodecount~5 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~edgecount~5 := main_#t~nondet1;havoc main_#t~nondet1;assume !!(0 <= main_~nodecount~5 && main_~nodecount~5 <= 4);assume !!(0 <= main_~edgecount~5 && main_~edgecount~5 <= 19);main_~source~5 := 0;main_~Source~5 := main_~Source~5[0 := 0];main_~Source~5 := main_~Source~5[1 := 4];main_~Source~5 := main_~Source~5[2 := 1];main_~Source~5 := main_~Source~5[3 := 1];main_~Source~5 := main_~Source~5[4 := 0];main_~Source~5 := main_~Source~5[5 := 0];main_~Source~5 := main_~Source~5[6 := 1];main_~Source~5 := main_~Source~5[7 := 3];main_~Source~5 := main_~Source~5[8 := 4];main_~Source~5 := main_~Source~5[9 := 4];main_~Source~5 := main_~Source~5[10 := 2];main_~Source~5 := main_~Source~5[11 := 2];main_~Source~5 := main_~Source~5[12 := 3];main_~Source~5 := main_~Source~5[13 := 0];main_~Source~5 := main_~Source~5[14 := 0];main_~Source~5 := main_~Source~5[15 := 3];main_~Source~5 := main_~Source~5[16 := 1];main_~Source~5 := main_~Source~5[17 := 2];main_~Source~5 := main_~Source~5[18 := 2];main_~Source~5 := main_~Source~5[19 := 3];main_~Dest~5 := main_~Dest~5[0 := 1];main_~Dest~5 := main_~Dest~5[1 := 3];main_~Dest~5 := main_~Dest~5[2 := 4];main_~Dest~5 := main_~Dest~5[3 := 1];main_~Dest~5 := main_~Dest~5[4 := 1];main_~Dest~5 := main_~Dest~5[5 := 4];main_~Dest~5 := main_~Dest~5[6 := 3];main_~Dest~5 := main_~Dest~5[7 := 4];main_~Dest~5 := main_~Dest~5[8 := 3];main_~Dest~5 := main_~Dest~5[9 := 0];main_~Dest~5 := main_~Dest~5[10 := 0];main_~Dest~5 := main_~Dest~5[11 := 0];main_~Dest~5 := main_~Dest~5[12 := 0];main_~Dest~5 := main_~Dest~5[13 := 2];main_~Dest~5 := main_~Dest~5[14 := 3];main_~Dest~5 := main_~Dest~5[15 := 0];main_~Dest~5 := main_~Dest~5[16 := 2];main_~Dest~5 := main_~Dest~5[17 := 1];main_~Dest~5 := main_~Dest~5[18 := 0];main_~Dest~5 := main_~Dest~5[19 := 4];main_~Weight~5 := main_~Weight~5[0 := 0];main_~Weight~5 := main_~Weight~5[1 := 1];main_~Weight~5 := main_~Weight~5[2 := 2];main_~Weight~5 := main_~Weight~5[3 := 3];main_~Weight~5 := main_~Weight~5[4 := 4];main_~Weight~5 := main_~Weight~5[5 := 5];main_~Weight~5 := main_~Weight~5[6 := 6];main_~Weight~5 := main_~Weight~5[7 := 7];main_~Weight~5 := main_~Weight~5[8 := 8];main_~Weight~5 := main_~Weight~5[9 := 9];main_~Weight~5 := main_~Weight~5[10 := 10];main_~Weight~5 := main_~Weight~5[11 := 11];main_~Weight~5 := main_~Weight~5[12 := 12];main_~Weight~5 := main_~Weight~5[13 := 13];main_~Weight~5 := main_~Weight~5[14 := 14];main_~Weight~5 := main_~Weight~5[15 := 15];main_~Weight~5 := main_~Weight~5[16 := 16];main_~Weight~5 := main_~Weight~5[17 := 17];main_~Weight~5 := main_~Weight~5[18 := 18];main_~Weight~5 := main_~Weight~5[19 := 19];havoc main_~distance~5;havoc main_~x~5;havoc main_~y~5;havoc main_~i~5;havoc main_~j~5;main_~i~5 := 0; {10#true} is VALID [2018-12-17 14:12:18,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#true} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0; {12#(= ULTIMATE.start_main_~i~5 0)} is VALID [2018-12-17 14:12:18,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(= ULTIMATE.start_main_~i~5 0)} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0;assume !(main_~i~5 < main_~edgecount~5);main_~i~5 := 0;assume !!(main_~i~5 < main_~nodecount~5);__VERIFIER_assert_#in~cond := (if main_~distance~5[main_~i~5] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2018-12-17 14:12:18,031 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2018-12-17 14:12:18,033 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,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:18,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-17 14:12:18,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:18,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:18,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:18,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:18,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:18,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:18,078 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-17 14:12:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,263 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-17 14:12:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:18,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-17 14:12:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-12-17 14:12:18,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2018-12-17 14:12:18,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:18,415 INFO L225 Difference]: With dead ends: 11 [2018-12-17 14:12:18,415 INFO L226 Difference]: Without dead ends: 7 [2018-12-17 14:12:18,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-17 14:12:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-17 14:12:18,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:18,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 6 states. [2018-12-17 14:12:18,530 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 6 states. [2018-12-17 14:12:18,530 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 6 states. [2018-12-17 14:12:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,533 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-17 14:12:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-17 14:12:18,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:18,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:18,534 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states. [2018-12-17 14:12:18,534 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states. [2018-12-17 14:12:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:18,536 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-17 14:12:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-17 14:12:18,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:18,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:18,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:18,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-17 14:12:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-17 14:12:18,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-12-17 14:12:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:18,548 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-17 14:12:18,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:12:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-17 14:12:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-17 14:12:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:18,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-17 14:12:18,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:18,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2018-12-17 14:12:18,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:18,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:18,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:18,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:18,927 INFO L273 TraceCheckUtils]: 0: Hoare triple {56#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post4, main_#t~post3, main_#t~post5, main_#t~post6, main_~nodecount~5, main_~edgecount~5, main_~source~5, main_~Source~5, main_~Dest~5, main_~Weight~5, main_~distance~5, main_~x~5, main_~y~5, main_~i~5, main_~j~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~nodecount~5 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~edgecount~5 := main_#t~nondet1;havoc main_#t~nondet1;assume !!(0 <= main_~nodecount~5 && main_~nodecount~5 <= 4);assume !!(0 <= main_~edgecount~5 && main_~edgecount~5 <= 19);main_~source~5 := 0;main_~Source~5 := main_~Source~5[0 := 0];main_~Source~5 := main_~Source~5[1 := 4];main_~Source~5 := main_~Source~5[2 := 1];main_~Source~5 := main_~Source~5[3 := 1];main_~Source~5 := main_~Source~5[4 := 0];main_~Source~5 := main_~Source~5[5 := 0];main_~Source~5 := main_~Source~5[6 := 1];main_~Source~5 := main_~Source~5[7 := 3];main_~Source~5 := main_~Source~5[8 := 4];main_~Source~5 := main_~Source~5[9 := 4];main_~Source~5 := main_~Source~5[10 := 2];main_~Source~5 := main_~Source~5[11 := 2];main_~Source~5 := main_~Source~5[12 := 3];main_~Source~5 := main_~Source~5[13 := 0];main_~Source~5 := main_~Source~5[14 := 0];main_~Source~5 := main_~Source~5[15 := 3];main_~Source~5 := main_~Source~5[16 := 1];main_~Source~5 := main_~Source~5[17 := 2];main_~Source~5 := main_~Source~5[18 := 2];main_~Source~5 := main_~Source~5[19 := 3];main_~Dest~5 := main_~Dest~5[0 := 1];main_~Dest~5 := main_~Dest~5[1 := 3];main_~Dest~5 := main_~Dest~5[2 := 4];main_~Dest~5 := main_~Dest~5[3 := 1];main_~Dest~5 := main_~Dest~5[4 := 1];main_~Dest~5 := main_~Dest~5[5 := 4];main_~Dest~5 := main_~Dest~5[6 := 3];main_~Dest~5 := main_~Dest~5[7 := 4];main_~Dest~5 := main_~Dest~5[8 := 3];main_~Dest~5 := main_~Dest~5[9 := 0];main_~Dest~5 := main_~Dest~5[10 := 0];main_~Dest~5 := main_~Dest~5[11 := 0];main_~Dest~5 := main_~Dest~5[12 := 0];main_~Dest~5 := main_~Dest~5[13 := 2];main_~Dest~5 := main_~Dest~5[14 := 3];main_~Dest~5 := main_~Dest~5[15 := 0];main_~Dest~5 := main_~Dest~5[16 := 2];main_~Dest~5 := main_~Dest~5[17 := 1];main_~Dest~5 := main_~Dest~5[18 := 0];main_~Dest~5 := main_~Dest~5[19 := 4];main_~Weight~5 := main_~Weight~5[0 := 0];main_~Weight~5 := main_~Weight~5[1 := 1];main_~Weight~5 := main_~Weight~5[2 := 2];main_~Weight~5 := main_~Weight~5[3 := 3];main_~Weight~5 := main_~Weight~5[4 := 4];main_~Weight~5 := main_~Weight~5[5 := 5];main_~Weight~5 := main_~Weight~5[6 := 6];main_~Weight~5 := main_~Weight~5[7 := 7];main_~Weight~5 := main_~Weight~5[8 := 8];main_~Weight~5 := main_~Weight~5[9 := 9];main_~Weight~5 := main_~Weight~5[10 := 10];main_~Weight~5 := main_~Weight~5[11 := 11];main_~Weight~5 := main_~Weight~5[12 := 12];main_~Weight~5 := main_~Weight~5[13 := 13];main_~Weight~5 := main_~Weight~5[14 := 14];main_~Weight~5 := main_~Weight~5[15 := 15];main_~Weight~5 := main_~Weight~5[16 := 16];main_~Weight~5 := main_~Weight~5[17 := 17];main_~Weight~5 := main_~Weight~5[18 := 18];main_~Weight~5 := main_~Weight~5[19 := 19];havoc main_~distance~5;havoc main_~x~5;havoc main_~y~5;havoc main_~i~5;havoc main_~j~5;main_~i~5 := 0; {58#(= ULTIMATE.start_main_~i~5 0)} is VALID [2018-12-17 14:12:18,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(= ULTIMATE.start_main_~i~5 0)} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0; {59#(and (= ULTIMATE.start_main_~i~5 0) (<= ULTIMATE.start_main_~nodecount~5 0))} is VALID [2018-12-17 14:12:18,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#(and (= ULTIMATE.start_main_~i~5 0) (<= ULTIMATE.start_main_~nodecount~5 0))} assume !!(main_~i~5 < main_~nodecount~5);main_~j~5 := 0;assume !(main_~j~5 < main_~edgecount~5);main_#t~post3 := main_~i~5;main_~i~5 := main_#t~post3 + 1;havoc main_#t~post3; {57#false} is VALID [2018-12-17 14:12:18,944 INFO L273 TraceCheckUtils]: 3: Hoare triple {57#false} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0;assume !(main_~i~5 < main_~edgecount~5);main_~i~5 := 0;assume !!(main_~i~5 < main_~nodecount~5);__VERIFIER_assert_#in~cond := (if main_~distance~5[main_~i~5] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {57#false} is VALID [2018-12-17 14:12:18,944 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#false} assume !false; {57#false} is VALID [2018-12-17 14:12:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:18,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-17 14:12:18,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:18,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-17 14:12:18,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:18,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-17 14:12:18,961 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,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-17 14:12:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-17 14:12:18,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-17 14:12:18,963 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-17 14:12:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:19,470 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-17 14:12:19,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-17 14:12:19,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-17 14:12:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:12:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-17 14:12:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:12:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-17 14:12:19,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-17 14:12:19,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:19,539 INFO L225 Difference]: With dead ends: 11 [2018-12-17 14:12:19,539 INFO L226 Difference]: Without dead ends: 7 [2018-12-17 14:12:19,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-17 14:12:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-17 14:12:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-17 14:12:19,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:19,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:19,573 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:19,573 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:19,575 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-17 14:12:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-17 14:12:19,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:19,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:19,576 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:19,576 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:19,577 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-17 14:12:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-17 14:12:19,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:19,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:19,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:19,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-17 14:12:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-17 14:12:19,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-17 14:12:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:19,580 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-17 14:12:19,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-17 14:12:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-17 14:12:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-17 14:12:19,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:19,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-17 14:12:19,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-17 14:12:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-17 14:12:19,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:19,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:19,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:19,826 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post4, main_#t~post3, main_#t~post5, main_#t~post6, main_~nodecount~5, main_~edgecount~5, main_~source~5, main_~Source~5, main_~Dest~5, main_~Weight~5, main_~distance~5, main_~x~5, main_~y~5, main_~i~5, main_~j~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~nodecount~5 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~edgecount~5 := main_#t~nondet1;havoc main_#t~nondet1;assume !!(0 <= main_~nodecount~5 && main_~nodecount~5 <= 4);assume !!(0 <= main_~edgecount~5 && main_~edgecount~5 <= 19);main_~source~5 := 0;main_~Source~5 := main_~Source~5[0 := 0];main_~Source~5 := main_~Source~5[1 := 4];main_~Source~5 := main_~Source~5[2 := 1];main_~Source~5 := main_~Source~5[3 := 1];main_~Source~5 := main_~Source~5[4 := 0];main_~Source~5 := main_~Source~5[5 := 0];main_~Source~5 := main_~Source~5[6 := 1];main_~Source~5 := main_~Source~5[7 := 3];main_~Source~5 := main_~Source~5[8 := 4];main_~Source~5 := main_~Source~5[9 := 4];main_~Source~5 := main_~Source~5[10 := 2];main_~Source~5 := main_~Source~5[11 := 2];main_~Source~5 := main_~Source~5[12 := 3];main_~Source~5 := main_~Source~5[13 := 0];main_~Source~5 := main_~Source~5[14 := 0];main_~Source~5 := main_~Source~5[15 := 3];main_~Source~5 := main_~Source~5[16 := 1];main_~Source~5 := main_~Source~5[17 := 2];main_~Source~5 := main_~Source~5[18 := 2];main_~Source~5 := main_~Source~5[19 := 3];main_~Dest~5 := main_~Dest~5[0 := 1];main_~Dest~5 := main_~Dest~5[1 := 3];main_~Dest~5 := main_~Dest~5[2 := 4];main_~Dest~5 := main_~Dest~5[3 := 1];main_~Dest~5 := main_~Dest~5[4 := 1];main_~Dest~5 := main_~Dest~5[5 := 4];main_~Dest~5 := main_~Dest~5[6 := 3];main_~Dest~5 := main_~Dest~5[7 := 4];main_~Dest~5 := main_~Dest~5[8 := 3];main_~Dest~5 := main_~Dest~5[9 := 0];main_~Dest~5 := main_~Dest~5[10 := 0];main_~Dest~5 := main_~Dest~5[11 := 0];main_~Dest~5 := main_~Dest~5[12 := 0];main_~Dest~5 := main_~Dest~5[13 := 2];main_~Dest~5 := main_~Dest~5[14 := 3];main_~Dest~5 := main_~Dest~5[15 := 0];main_~Dest~5 := main_~Dest~5[16 := 2];main_~Dest~5 := main_~Dest~5[17 := 1];main_~Dest~5 := main_~Dest~5[18 := 0];main_~Dest~5 := main_~Dest~5[19 := 4];main_~Weight~5 := main_~Weight~5[0 := 0];main_~Weight~5 := main_~Weight~5[1 := 1];main_~Weight~5 := main_~Weight~5[2 := 2];main_~Weight~5 := main_~Weight~5[3 := 3];main_~Weight~5 := main_~Weight~5[4 := 4];main_~Weight~5 := main_~Weight~5[5 := 5];main_~Weight~5 := main_~Weight~5[6 := 6];main_~Weight~5 := main_~Weight~5[7 := 7];main_~Weight~5 := main_~Weight~5[8 := 8];main_~Weight~5 := main_~Weight~5[9 := 9];main_~Weight~5 := main_~Weight~5[10 := 10];main_~Weight~5 := main_~Weight~5[11 := 11];main_~Weight~5 := main_~Weight~5[12 := 12];main_~Weight~5 := main_~Weight~5[13 := 13];main_~Weight~5 := main_~Weight~5[14 := 14];main_~Weight~5 := main_~Weight~5[15 := 15];main_~Weight~5 := main_~Weight~5[16 := 16];main_~Weight~5 := main_~Weight~5[17 := 17];main_~Weight~5 := main_~Weight~5[18 := 18];main_~Weight~5 := main_~Weight~5[19 := 19];havoc main_~distance~5;havoc main_~x~5;havoc main_~y~5;havoc main_~i~5;havoc main_~j~5;main_~i~5 := 0; {109#(= ULTIMATE.start_main_~i~5 0)} is VALID [2018-12-17 14:12:19,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < main_~nodecount~5);assume main_~i~5 == main_~source~5;main_~distance~5 := main_~distance~5[main_~i~5 := 0];main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:19,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0; {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:19,865 INFO L273 TraceCheckUtils]: 3: Hoare triple {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !!(main_~i~5 < main_~nodecount~5);main_~j~5 := 0;assume !(main_~j~5 < main_~edgecount~5);main_#t~post3 := main_~i~5;main_~i~5 := main_#t~post3 + 1;havoc main_#t~post3; {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:19,878 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0;assume !(main_~i~5 < main_~edgecount~5);main_~i~5 := 0;assume !!(main_~i~5 < main_~nodecount~5);__VERIFIER_assert_#in~cond := (if main_~distance~5[main_~i~5] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-17 14:12:19,879 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-17 14:12:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-17 14:12:19,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:12:19,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:12:19,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-17 14:12:19,883 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-17 14:12:19,928 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-17 14:12:19,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:12:20,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-17 14:12:20,256 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 4 times. Never widened. Performed 370 root evaluator evaluations with a maximum evaluation depth of 4. Performed 370 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-17 14:12:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:20,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-17 14:12:20,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:12:20,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-17 14:12:20,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:20,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-17 14:12:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:20,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-17 14:12:20,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-17 14:12:20,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-17 14:12:20,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-17 14:12:20,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-17 14:12:20,509 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-17 14:12:20,509 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~distance~5_6]. (= ULTIMATE.start_main_~distance~5 (store v_ULTIMATE.start_main_~distance~5_6 0 0)) [2018-12-17 14:12:20,509 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 (select ULTIMATE.start_main_~distance~5 0)) [2018-12-17 14:12:20,594 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post4, main_#t~post3, main_#t~post5, main_#t~post6, main_~nodecount~5, main_~edgecount~5, main_~source~5, main_~Source~5, main_~Dest~5, main_~Weight~5, main_~distance~5, main_~x~5, main_~y~5, main_~i~5, main_~j~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~nodecount~5 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~edgecount~5 := main_#t~nondet1;havoc main_#t~nondet1;assume !!(0 <= main_~nodecount~5 && main_~nodecount~5 <= 4);assume !!(0 <= main_~edgecount~5 && main_~edgecount~5 <= 19);main_~source~5 := 0;main_~Source~5 := main_~Source~5[0 := 0];main_~Source~5 := main_~Source~5[1 := 4];main_~Source~5 := main_~Source~5[2 := 1];main_~Source~5 := main_~Source~5[3 := 1];main_~Source~5 := main_~Source~5[4 := 0];main_~Source~5 := main_~Source~5[5 := 0];main_~Source~5 := main_~Source~5[6 := 1];main_~Source~5 := main_~Source~5[7 := 3];main_~Source~5 := main_~Source~5[8 := 4];main_~Source~5 := main_~Source~5[9 := 4];main_~Source~5 := main_~Source~5[10 := 2];main_~Source~5 := main_~Source~5[11 := 2];main_~Source~5 := main_~Source~5[12 := 3];main_~Source~5 := main_~Source~5[13 := 0];main_~Source~5 := main_~Source~5[14 := 0];main_~Source~5 := main_~Source~5[15 := 3];main_~Source~5 := main_~Source~5[16 := 1];main_~Source~5 := main_~Source~5[17 := 2];main_~Source~5 := main_~Source~5[18 := 2];main_~Source~5 := main_~Source~5[19 := 3];main_~Dest~5 := main_~Dest~5[0 := 1];main_~Dest~5 := main_~Dest~5[1 := 3];main_~Dest~5 := main_~Dest~5[2 := 4];main_~Dest~5 := main_~Dest~5[3 := 1];main_~Dest~5 := main_~Dest~5[4 := 1];main_~Dest~5 := main_~Dest~5[5 := 4];main_~Dest~5 := main_~Dest~5[6 := 3];main_~Dest~5 := main_~Dest~5[7 := 4];main_~Dest~5 := main_~Dest~5[8 := 3];main_~Dest~5 := main_~Dest~5[9 := 0];main_~Dest~5 := main_~Dest~5[10 := 0];main_~Dest~5 := main_~Dest~5[11 := 0];main_~Dest~5 := main_~Dest~5[12 := 0];main_~Dest~5 := main_~Dest~5[13 := 2];main_~Dest~5 := main_~Dest~5[14 := 3];main_~Dest~5 := main_~Dest~5[15 := 0];main_~Dest~5 := main_~Dest~5[16 := 2];main_~Dest~5 := main_~Dest~5[17 := 1];main_~Dest~5 := main_~Dest~5[18 := 0];main_~Dest~5 := main_~Dest~5[19 := 4];main_~Weight~5 := main_~Weight~5[0 := 0];main_~Weight~5 := main_~Weight~5[1 := 1];main_~Weight~5 := main_~Weight~5[2 := 2];main_~Weight~5 := main_~Weight~5[3 := 3];main_~Weight~5 := main_~Weight~5[4 := 4];main_~Weight~5 := main_~Weight~5[5 := 5];main_~Weight~5 := main_~Weight~5[6 := 6];main_~Weight~5 := main_~Weight~5[7 := 7];main_~Weight~5 := main_~Weight~5[8 := 8];main_~Weight~5 := main_~Weight~5[9 := 9];main_~Weight~5 := main_~Weight~5[10 := 10];main_~Weight~5 := main_~Weight~5[11 := 11];main_~Weight~5 := main_~Weight~5[12 := 12];main_~Weight~5 := main_~Weight~5[13 := 13];main_~Weight~5 := main_~Weight~5[14 := 14];main_~Weight~5 := main_~Weight~5[15 := 15];main_~Weight~5 := main_~Weight~5[16 := 16];main_~Weight~5 := main_~Weight~5[17 := 17];main_~Weight~5 := main_~Weight~5[18 := 18];main_~Weight~5 := main_~Weight~5[19 := 19];havoc main_~distance~5;havoc main_~x~5;havoc main_~y~5;havoc main_~i~5;havoc main_~j~5;main_~i~5 := 0; {109#(= ULTIMATE.start_main_~i~5 0)} is VALID [2018-12-17 14:12:20,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < main_~nodecount~5);assume main_~i~5 == main_~source~5;main_~distance~5 := main_~distance~5[main_~i~5 := 0];main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:20,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0; {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:20,599 INFO L273 TraceCheckUtils]: 3: Hoare triple {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !!(main_~i~5 < main_~nodecount~5);main_~j~5 := 0;assume !(main_~j~5 < main_~edgecount~5);main_#t~post3 := main_~i~5;main_~i~5 := main_#t~post3 + 1;havoc main_#t~post3; {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:20,600 INFO L273 TraceCheckUtils]: 4: Hoare triple {110#(= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0;assume !(main_~i~5 < main_~edgecount~5);main_~i~5 := 0;assume !!(main_~i~5 < main_~nodecount~5);__VERIFIER_assert_#in~cond := (if main_~distance~5[main_~i~5] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-17 14:12:20,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-17 14:12:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-17 14:12:20,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-17 14:12:20,977 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-12-17 14:12:20,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-17 14:12:20,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-17 14:12:20,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-17 14:12:20,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-12-17 14:12:20,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-17 14:12:21,019 INFO L273 TraceCheckUtils]: 4: Hoare triple {132#(<= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0;assume !(main_~i~5 < main_~edgecount~5);main_~i~5 := 0;assume !!(main_~i~5 < main_~nodecount~5);__VERIFIER_assert_#in~cond := (if main_~distance~5[main_~i~5] >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-17 14:12:21,031 INFO L273 TraceCheckUtils]: 3: Hoare triple {132#(<= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !!(main_~i~5 < main_~nodecount~5);main_~j~5 := 0;assume !(main_~j~5 < main_~edgecount~5);main_#t~post3 := main_~i~5;main_~i~5 := main_#t~post3 + 1;havoc main_#t~post3; {132#(<= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:21,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#(<= 0 (select ULTIMATE.start_main_~distance~5 0))} assume !(main_~i~5 < main_~nodecount~5);main_~i~5 := 0; {132#(<= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:21,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < main_~nodecount~5);assume main_~i~5 == main_~source~5;main_~distance~5 := main_~distance~5[main_~i~5 := 0];main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {132#(<= 0 (select ULTIMATE.start_main_~distance~5 0))} is VALID [2018-12-17 14:12:21,078 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} ~INFINITY := 899;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~post2, main_#t~post4, main_#t~post3, main_#t~post5, main_#t~post6, main_~nodecount~5, main_~edgecount~5, main_~source~5, main_~Source~5, main_~Dest~5, main_~Weight~5, main_~distance~5, main_~x~5, main_~y~5, main_~i~5, main_~j~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~nodecount~5 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~edgecount~5 := main_#t~nondet1;havoc main_#t~nondet1;assume !!(0 <= main_~nodecount~5 && main_~nodecount~5 <= 4);assume !!(0 <= main_~edgecount~5 && main_~edgecount~5 <= 19);main_~source~5 := 0;main_~Source~5 := main_~Source~5[0 := 0];main_~Source~5 := main_~Source~5[1 := 4];main_~Source~5 := main_~Source~5[2 := 1];main_~Source~5 := main_~Source~5[3 := 1];main_~Source~5 := main_~Source~5[4 := 0];main_~Source~5 := main_~Source~5[5 := 0];main_~Source~5 := main_~Source~5[6 := 1];main_~Source~5 := main_~Source~5[7 := 3];main_~Source~5 := main_~Source~5[8 := 4];main_~Source~5 := main_~Source~5[9 := 4];main_~Source~5 := main_~Source~5[10 := 2];main_~Source~5 := main_~Source~5[11 := 2];main_~Source~5 := main_~Source~5[12 := 3];main_~Source~5 := main_~Source~5[13 := 0];main_~Source~5 := main_~Source~5[14 := 0];main_~Source~5 := main_~Source~5[15 := 3];main_~Source~5 := main_~Source~5[16 := 1];main_~Source~5 := main_~Source~5[17 := 2];main_~Source~5 := main_~Source~5[18 := 2];main_~Source~5 := main_~Source~5[19 := 3];main_~Dest~5 := main_~Dest~5[0 := 1];main_~Dest~5 := main_~Dest~5[1 := 3];main_~Dest~5 := main_~Dest~5[2 := 4];main_~Dest~5 := main_~Dest~5[3 := 1];main_~Dest~5 := main_~Dest~5[4 := 1];main_~Dest~5 := main_~Dest~5[5 := 4];main_~Dest~5 := main_~Dest~5[6 := 3];main_~Dest~5 := main_~Dest~5[7 := 4];main_~Dest~5 := main_~Dest~5[8 := 3];main_~Dest~5 := main_~Dest~5[9 := 0];main_~Dest~5 := main_~Dest~5[10 := 0];main_~Dest~5 := main_~Dest~5[11 := 0];main_~Dest~5 := main_~Dest~5[12 := 0];main_~Dest~5 := main_~Dest~5[13 := 2];main_~Dest~5 := main_~Dest~5[14 := 3];main_~Dest~5 := main_~Dest~5[15 := 0];main_~Dest~5 := main_~Dest~5[16 := 2];main_~Dest~5 := main_~Dest~5[17 := 1];main_~Dest~5 := main_~Dest~5[18 := 0];main_~Dest~5 := main_~Dest~5[19 := 4];main_~Weight~5 := main_~Weight~5[0 := 0];main_~Weight~5 := main_~Weight~5[1 := 1];main_~Weight~5 := main_~Weight~5[2 := 2];main_~Weight~5 := main_~Weight~5[3 := 3];main_~Weight~5 := main_~Weight~5[4 := 4];main_~Weight~5 := main_~Weight~5[5 := 5];main_~Weight~5 := main_~Weight~5[6 := 6];main_~Weight~5 := main_~Weight~5[7 := 7];main_~Weight~5 := main_~Weight~5[8 := 8];main_~Weight~5 := main_~Weight~5[9 := 9];main_~Weight~5 := main_~Weight~5[10 := 10];main_~Weight~5 := main_~Weight~5[11 := 11];main_~Weight~5 := main_~Weight~5[12 := 12];main_~Weight~5 := main_~Weight~5[13 := 13];main_~Weight~5 := main_~Weight~5[14 := 14];main_~Weight~5 := main_~Weight~5[15 := 15];main_~Weight~5 := main_~Weight~5[16 := 16];main_~Weight~5 := main_~Weight~5[17 := 17];main_~Weight~5 := main_~Weight~5[18 := 18];main_~Weight~5 := main_~Weight~5[19 := 19];havoc main_~distance~5;havoc main_~x~5;havoc main_~y~5;havoc main_~i~5;havoc main_~j~5;main_~i~5 := 0; {109#(= ULTIMATE.start_main_~i~5 0)} is VALID [2018-12-17 14:12:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-17 14:12:21,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-17 14:12:21,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2018-12-17 14:12:21,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-17 14:12:21,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-17 14:12:21,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:21,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-17 14:12:21,188 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:21,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-17 14:12:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-17 14:12:21,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-17 14:12:21,189 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-17 14:12:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:21,773 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-17 14:12:21,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-17 14:12:21,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-17 14:12:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:12:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-17 14:12:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-17 14:12:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-12-17 14:12:21,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2018-12-17 14:12:21,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:21,884 INFO L225 Difference]: With dead ends: 7 [2018-12-17 14:12:21,884 INFO L226 Difference]: Without dead ends: 0 [2018-12-17 14:12:21,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-17 14:12:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-17 14:12:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-17 14:12:21,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:21,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-17 14:12:21,885 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-17 14:12:21,885 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-17 14:12:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:21,886 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-17 14:12:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-17 14:12:21,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:21,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:21,887 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-17 14:12:21,887 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-17 14:12:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:21,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-17 14:12:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-17 14:12:21,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:21,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:21,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:21,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-17 14:12:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-17 14:12:21,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-17 14:12:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:21,889 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-17 14:12:21,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-17 14:12:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-17 14:12:21,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:21,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-17 14:12:22,064 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 153) no Hoare annotation was computed. [2018-12-17 14:12:22,064 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 153) no Hoare annotation was computed. [2018-12-17 14:12:22,064 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 153) no Hoare annotation was computed. [2018-12-17 14:12:22,064 INFO L444 ceAbstractionStarter]: At program point L122(lines 105 122) the Hoare annotation is: (or (= 0 (select ULTIMATE.start_main_~distance~5 0)) (= ULTIMATE.start_main_~i~5 0)) [2018-12-17 14:12:22,065 INFO L444 ceAbstractionStarter]: At program point L150(lines 114 150) the Hoare annotation is: (or (= 0 (select ULTIMATE.start_main_~distance~5 0)) (and (= ULTIMATE.start_main_~i~5 0) (<= ULTIMATE.start_main_~nodecount~5 0))) [2018-12-17 14:12:22,065 INFO L444 ceAbstractionStarter]: At program point L141(lines 141 151) the Hoare annotation is: false [2018-12-17 14:12:22,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 152) no Hoare annotation was computed. [2018-12-17 14:12:22,067 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-17 14:12:22,070 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-17 14:12:22,071 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-12-17 14:12:22,071 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-12-17 14:12:22,071 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-17 14:12:22,078 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:12:22 BoogieIcfgContainer [2018-12-17 14:12:22,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-17 14:12:22,080 INFO L168 Benchmark]: Toolchain (without parser) took 5405.50 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -669.4 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:22,081 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:22,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:22,082 INFO L168 Benchmark]: Boogie Preprocessor took 31.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:22,082 INFO L168 Benchmark]: RCFGBuilder took 842.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:22,083 INFO L168 Benchmark]: TraceAbstraction took 4478.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:22,087 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 842.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4478.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: 0 == main_~distance~5[0] || main_~i~5 == 0 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: 0 == main_~distance~5[0] || (main_~i~5 == 0 && main_~nodecount~5 <= 0) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 4.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 20 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 23 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 5 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...