java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:32:57,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:32:57,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:32:57,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:32:57,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:32:57,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:32:57,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:32:57,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:32:57,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:32:57,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:32:57,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:32:57,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:32:57,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:32:57,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:32:57,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:32:57,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:32:57,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:32:57,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:32:57,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:32:57,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:32:57,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:32:57,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:32:57,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:32:57,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:32:57,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:32:57,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:32:57,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:32:57,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:32:57,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:32:57,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:32:57,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:32:57,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:32:57,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:32:57,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:32:57,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:32:57,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:32:57,500 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 13:32:57,517 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:32:57,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:32:57,519 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:32:57,519 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:32:57,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:32:57,519 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:32:57,519 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:32:57,520 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:32:57,520 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:32:57,520 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:32:57,520 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:32:57,520 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:32:57,521 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:32:57,521 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:32:57,522 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:32:57,522 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:32:57,522 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:32:57,522 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:32:57,522 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:32:57,523 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:32:57,523 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:32:57,523 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:32:57,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:32:57,523 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:32:57,524 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:32:57,524 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:32:57,524 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:32:57,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:32:57,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:32:57,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:32:57,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:32:57,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:32:57,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:32:57,525 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:32:57,526 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:32:57,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:32:57,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:32:57,526 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:32:57,526 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:32:57,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:32:57,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:32:57,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:32:57,584 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:32:57,585 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:32:57,586 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 [2019-02-28 13:32:57,586 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-02-28 13:32:57,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:32:57,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:32:57,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:32:57,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:32:57,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:32:57,702 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,719 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:32:57,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:32:57,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:32:57,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:32:57,744 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,745 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,754 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,755 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,768 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,774 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,781 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:32:57,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:32:57,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:32:57,785 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:32:57,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:32:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:32:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:32:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:32:58,455 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:32:58,456 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-28 13:32:58,457 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:32:58 BoogieIcfgContainer [2019-02-28 13:32:58,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:32:58,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:32:58,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:32:58,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:32:58,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:32:57" (1/2) ... [2019-02-28 13:32:58,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc3b4e0 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:32:58, skipping insertion in model container [2019-02-28 13:32:58,464 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 28.02 01:32:58" (2/2) ... [2019-02-28 13:32:58,466 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-02-28 13:32:58,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:32:58,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:32:58,497 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:32:58,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:32:58,527 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:32:58,527 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:32:58,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:32:58,527 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:32:58,527 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:32:58,528 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:32:58,528 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:32:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-28 13:32:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:32:58,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:32:58,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:32:58,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:32:58,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:32:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-02-28 13:32:58,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:32:58,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:58,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:32:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:58,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:32:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:32:58,861 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 [2019-02-28 13:32:58,881 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 [2019-02-28 13:32:58,898 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 [2019-02-28 13:32:58,903 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 [2019-02-28 13:32:58,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2019-02-28 13:32:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:32:58,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:32:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:32:58,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:32:58,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:32:58,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:32:58,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:32:58,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:32:58,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:32:58,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:32:58,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:32:58,973 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-02-28 13:32:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,420 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-28 13:32:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:32:59,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:32:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:32:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:32:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-02-28 13:32:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:32:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-02-28 13:32:59,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2019-02-28 13:32:59,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:32:59,565 INFO L225 Difference]: With dead ends: 15 [2019-02-28 13:32:59,565 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 13:32:59,569 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 [2019-02-28 13:32:59,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 13:32:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-02-28 13:32:59,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:32:59,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 8 states. [2019-02-28 13:32:59,647 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 8 states. [2019-02-28 13:32:59,648 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 8 states. [2019-02-28 13:32:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,650 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-28 13:32:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2019-02-28 13:32:59,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:32:59,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:32:59,651 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 11 states. [2019-02-28 13:32:59,651 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 11 states. [2019-02-28 13:32:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,653 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-28 13:32:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2019-02-28 13:32:59,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:32:59,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:32:59,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:32:59,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:32:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:32:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-28 13:32:59,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-02-28 13:32:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:32:59,658 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-02-28 13:32:59,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:32:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-02-28 13:32:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 13:32:59,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:32:59,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 13:32:59,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:32:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:32:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-02-28 13:32:59,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:32:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:32:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:59,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:32:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:32:59,952 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 [2019-02-28 13:32:59,967 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 [2019-02-28 13:32:59,985 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 [2019-02-28 13:32:59,998 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 [2019-02-28 13:33:00,000 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 [2019-02-28 13:33:00,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {80#false} assume !false; {80#false} is VALID [2019-02-28 13:33:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:00,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:00,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:00,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 13:33:00,003 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-02-28 13:33:00,056 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:33:00,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:40:26,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 13:40:26,119 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2019-02-28 13:40:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:40:26,124 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates