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_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:32:57,175 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:32:57,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:32:57,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:32:57,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:32:57,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:32:57,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:32:57,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:32:57,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:32:57,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:32:57,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:32:57,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:32:57,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:32:57,202 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:32:57,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:32:57,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:32:57,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:32:57,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:32:57,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:32:57,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:32:57,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:32:57,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:32:57,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:32:57,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:32:57,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:32:57,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:32:57,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:32:57,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:32:57,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:32:57,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:32:57,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:32:57,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:32:57,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:32:57,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:32:57,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:32:57,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:32:57,225 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,238 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:32:57,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:32:57,239 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:32:57,240 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:32:57,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:32:57,240 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:32:57,240 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:32:57,240 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:32:57,241 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:32:57,241 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:32:57,241 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:32:57,241 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:32:57,241 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:32:57,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:32:57,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:32:57,243 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:32:57,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:32:57,243 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:32:57,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:32:57,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:32:57,244 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:32:57,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:32:57,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:32:57,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:32:57,244 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:32:57,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:32:57,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:32:57,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:32:57,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:32:57,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:32:57,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:32:57,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:32:57,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:32:57,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:32:57,246 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:32:57,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:32:57,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:32:57,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:32:57,247 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:32:57,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:32:57,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:32:57,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:32:57,323 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:32:57,323 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:32:57,324 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 [2019-02-28 13:32:57,324 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_3.bpl' [2019-02-28 13:32:57,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:32:57,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:32:57,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:32:57,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:32:57,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:32:57,423 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,439 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:32:57,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:32:57,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:32:57,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:32:57,464 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,465 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,472 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,473 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,487 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,494 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,495 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 28.02 01:32:57" (1/1) ... [2019-02-28 13:32:57,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:32:57,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:32:57,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:32:57,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:32:57,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_3.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,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:32:57,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:32:58,227 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:32:58,228 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-28 13:32:58,229 INFO L202 PluginConnector]: Adding new model eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:32:58 BoogieIcfgContainer [2019-02-28 13:32:58,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:32:58,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:32:58,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:32:58,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:32:58,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:32:57" (1/2) ... [2019-02-28 13:32:58,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28402e1b and model type eureka_01.i_3.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,236 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 28.02 01:32:58" (2/2) ... [2019-02-28 13:32:58,238 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_3.bpl [2019-02-28 13:32:58,248 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:32:58,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:32:58,275 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:32:58,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:32:58,308 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:32:58,309 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:32:58,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:32:58,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:32:58,309 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:32:58,309 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:32:58,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:32:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 13:32:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:32:58,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:32:58,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:32:58,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:32:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:32:58,360 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-28 13:32:58,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:32:58,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:58,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:32:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:58,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:32:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:32:58,600 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 [2019-02-28 13:32:58,611 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 [2019-02-28 13:32:58,621 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 [2019-02-28 13:32:58,622 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-02-28 13:32:58,625 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,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:32:58,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:32:58,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:32:58,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 13:32:58,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:32:58,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:32:58,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:32:58,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:32:58,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:32:58,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:32:58,674 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 13:32:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:58,938 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-28 13:32:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:32:58,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 13:32:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:32:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:32:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-02-28 13:32:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:32:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-02-28 13:32:58,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2019-02-28 13:32:59,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:32:59,089 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:32:59,089 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:32:59,092 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 [2019-02-28 13:32:59,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:32:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-28 13:32:59,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:32:59,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 6 states. [2019-02-28 13:32:59,126 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 6 states. [2019-02-28 13:32:59,127 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 6 states. [2019-02-28 13:32:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,129 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-28 13:32:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:32:59,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:32:59,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:32:59,130 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states. [2019-02-28 13:32:59,130 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states. [2019-02-28 13:32:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,131 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-28 13:32:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:32:59,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:32:59,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:32:59,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:32:59,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:32:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:32:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-28 13:32:59,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-02-28 13:32:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:32:59,136 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-28 13:32:59,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:32:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-28 13:32:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:32:59,137 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:32:59,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:32:59,137 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:32:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:32:59,138 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-02-28 13:32:59,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:32:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:59,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:32:59,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:59,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:32:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:32:59,439 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 [2019-02-28 13:32:59,441 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 [2019-02-28 13:32:59,442 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 [2019-02-28 13:32:59,442 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 [2019-02-28 13:32:59,443 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#false} assume !false; {57#false} is VALID [2019-02-28 13:32:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:32:59,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:32:59,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:32:59,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:32:59,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:32:59,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:32:59,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:32:59,500 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:59,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:32:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:32:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:32:59,502 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-28 13:32:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,655 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-02-28 13:32:59,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:32:59,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:32:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:32:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:32:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:32:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:32:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:32:59,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-28 13:32:59,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:32:59,689 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:32:59,690 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:32:59,691 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 [2019-02-28 13:32:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:32:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 13:32:59,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:32:59,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-28 13:32:59,702 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:32:59,702 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:32:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,704 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-02-28 13:32:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 13:32:59,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:32:59,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:32:59,705 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:32:59,705 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:32:59,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:32:59,709 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-02-28 13:32:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 13:32:59,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:32:59,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:32:59,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:32:59,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:32:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:32:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 13:32:59,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-28 13:32:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:32:59,712 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 13:32:59,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:32:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 13:32:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 13:32:59,712 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:32:59,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 13:32:59,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:32:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:32:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-28 13:32:59,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:32:59,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:59,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:32:59,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:32:59,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:32:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:32:59,965 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 [2019-02-28 13:32:59,966 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 [2019-02-28 13:32:59,966 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 [2019-02-28 13:32:59,967 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 [2019-02-28 13:32:59,972 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 [2019-02-28 13:32:59,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#false} assume !false; {108#false} is VALID [2019-02-28 13:32:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 13:32:59,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:32:59,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:32:59,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 13:32:59,976 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-28 13:33:00,034 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:33:00,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)