java -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-0ed9222-m [2019-01-11 14:37:01,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:37:01,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:37:01,590 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:37:01,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:37:01,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:37:01,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:37:01,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:37:01,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:37:01,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:37:01,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:37:01,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:37:01,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:37:01,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:37:01,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:37:01,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:37:01,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:37:01,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:37:01,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:37:01,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:37:01,611 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:37:01,612 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:37:01,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:37:01,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:37:01,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:37:01,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:37:01,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:37:01,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:37:01,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:37:01,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:37:01,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:37:01,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:37:01,621 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:37:01,622 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:37:01,623 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:37:01,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:37:01,624 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-01-11 14:37:01,637 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:37:01,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:37:01,638 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:37:01,639 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:37:01,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:37:01,639 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:37:01,639 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:37:01,639 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:37:01,640 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:37:01,640 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 14:37:01,640 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 14:37:01,640 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:37:01,640 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:37:01,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:37:01,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:37:01,641 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:37:01,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:37:01,642 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:37:01,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:37:01,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:37:01,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:37:01,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:37:01,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:37:01,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:37:01,643 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:37:01,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:37:01,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:37:01,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:37:01,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:37:01,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:37:01,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:37:01,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:37:01,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:37:01,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:37:01,645 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:37:01,646 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:37:01,646 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:37:01,646 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:37:01,646 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:37:01,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:37:01,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:37:01,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:37:01,697 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:37:01,697 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:37:01,698 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-01-11 14:37:01,698 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-01-11 14:37:01,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:37:01,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:37:01,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:37:01,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:37:01,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:37:01,770 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,787 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:37:01,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:37:01,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:37:01,800 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:37:01,812 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,812 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,824 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,824 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,839 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,844 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,851 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:37:01,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:37:01,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:37:01,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:37:01,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:37:01" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:37:01,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:37:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:37:02,364 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:37:02,364 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 14:37:02,366 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:37:02 BoogieIcfgContainer [2019-01-11 14:37:02,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:37:02,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:37:02,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:37:02,373 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:37:02,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:37:01" (1/2) ... [2019-01-11 14:37:02,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a311d7c and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:37:02, skipping insertion in model container [2019-01-11 14:37:02,378 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 11.01 02:37:02" (2/2) ... [2019-01-11 14:37:02,381 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-01-11 14:37:02,395 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:37:02,402 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:37:02,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:37:02,446 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:37:02,447 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:37:02,447 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:37:02,447 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:37:02,447 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:37:02,447 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:37:02,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:37:02,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:37:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-11 14:37:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:37:02,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:37:02,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:37:02,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:37:02,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-01-11 14:37:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:37:02,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:37:02,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:37:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:37:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:37:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:37:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:37:02,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:37:02,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:37:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:37:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:37:02,804 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-01-11 14:37:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:37:02,928 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-01-11 14:37:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:37:02,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:37:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:37:02,943 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:37:02,944 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:37:02,947 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-01-11 14:37:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:37:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-11 14:37:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:37:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-11 14:37:02,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-01-11 14:37:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:37:02,983 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-11 14:37:02,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:37:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-01-11 14:37:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:37:02,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:37:02,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:37:02,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:37:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-01-11 14:37:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:37:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:37:02,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:37:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:37:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:37:03,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:37:03,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:37:03,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:37:03,350 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-01-11 14:37:03,436 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:37:03,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:41:59,852 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-11 14:41:59,854 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2019-01-11 14:41:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:41:59,857 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-11 14:42:05,222 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 25% of their original sizes. [2019-01-11 14:42:05,223 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-11 14:42:08,675 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_190 Int) (v_idx_223 Int) (v_idx_224 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_221 Int) (v_idx_188 Int) (v_idx_222 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_220 Int) (v_idx_187 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_214 Int) (v_idx_215 Int) (v_idx_179 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int) (v_idx_173 Int) (v_idx_174 Int) (v_idx_171 Int) (v_idx_172 Int) (v_idx_177 Int) (v_idx_210 Int) (v_idx_178 Int) (v_idx_211 Int) (v_idx_175 Int) (v_idx_176 Int) (v_idx_170 Int) (v_idx_209 Int) (v_idx_203 Int) (v_idx_204 Int) (v_idx_201 Int) (v_idx_202 Int) (v_idx_169 Int) (v_idx_207 Int) (v_idx_208 Int) (v_idx_205 Int) (v_idx_206 Int) (v_idx_200 Int) (v_idx_195 Int) (v_idx_196 Int) (v_idx_193 Int) (v_idx_194 Int) (v_idx_199 Int) (v_idx_197 Int) (v_idx_198 Int)) (exists ((v_v_8_1 Int) (v_v_67_1 Int) (v_v_68_1 Int) (v_v_127_1 Int) (v_v_128_1 Int) (v_v_187_1 Int)) (let ((.cse5 (* 2 c_ULTIMATE.start_main_~i~4)) (.cse10 (+ c_ULTIMATE.start_main_~i~4 18)) (.cse9 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~i~4)) (.cse0 (+ c_ULTIMATE.start_main_~nodecount~4 15)) (.cse1 (+ c_ULTIMATE.start_main_~i~4 17)) (.cse2 (+ c_ULTIMATE.start_main_~i~4 16)) (.cse15 (* 2 c_ULTIMATE.start_main_~edgecount~4)) (.cse7 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse14 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse11 (+ c_ULTIMATE.start_main_~i~4 3)) (.cse3 (+ c_ULTIMATE.start_main_~nodecount~4 14)) (.cse6 (* 2 c_ULTIMATE.start_main_~nodecount~4)) (.cse8 (+ c_ULTIMATE.start_main_~i~4 20)) (.cse13 (+ c_ULTIMATE.start_main_~nodecount~4 8)) (.cse4 (+ c_ULTIMATE.start_main_~i~4 4)) (.cse12 (+ c_ULTIMATE.start_main_~i~4 5))) (and (<= .cse0 c_ULTIMATE.start_main_~edgecount~4) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_220) 3) c_ULTIMATE.start_main_~nodecount~4) (<= .cse1 v_idx_220) (< v_idx_220 .cse2)) (or (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_204) 3) c_ULTIMATE.start_main_~nodecount~4) (< v_idx_204 .cse1) (<= .cse3 v_idx_204)) (or (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_223)) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_223) (< v_idx_223 .cse3)) (or (= 34 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_184) c_ULTIMATE.start_main_~edgecount~4)) (< (+ v_idx_184 c_ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ c_ULTIMATE.start_main_~i~4 v_idx_184))) (<= 0 .cse5) (<= .cse5 0) (<= .cse6 10) (or (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_198) 13) (= .cse4 (select c_ULTIMATE.start_main_~Source~4 v_idx_198)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_198 10))) (or (< v_idx_179 9) (= 9 (select c_ULTIMATE.start_main_~Weight~4 v_idx_179)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_179 10))) (or (<= 25 (+ v_idx_174 c_ULTIMATE.start_main_~edgecount~4)) (= .cse4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_174)) (< v_idx_174 .cse4)) (<= .cse7 20) (or (< (+ v_idx_219 c_ULTIMATE.start_main_~i~4) 15) (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_219) 20)) (<= .cse2 v_idx_219)) (or (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_192) 20)) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_192 4)) (< (+ v_idx_192 20) c_ULTIMATE.start_main_~edgecount~4)) (or (< v_idx_206 c_ULTIMATE.start_main_~edgecount~4) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_206) v_v_67_1)) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_207) v_v_68_1) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_207 20))) (or (< (+ v_idx_193 4) c_ULTIMATE.start_main_~nodecount~4) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_193 3)) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_193) .cse4)) (<= c_ULTIMATE.start_main_~edgecount~4 .cse8) (<= 20 c_ULTIMATE.start_main_~edgecount~4) (<= .cse9 5) (or (= .cse1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_187)) (<= .cse10 v_idx_187) (< v_idx_187 .cse1)) (or (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_170) 20)) (< (+ v_idx_170 20) c_ULTIMATE.start_main_~edgecount~4) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_170 4))) (<= c_ULTIMATE.start_main_~nodecount~4 5) (or (<= 9 v_idx_178) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_178) 13) (= 13 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_178) c_ULTIMATE.start_main_~nodecount~4))) (or (<= .cse3 v_idx_222) (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_222) 20) c_ULTIMATE.start_main_~edgecount~4) (< v_idx_222 .cse10)) (or (< (+ v_idx_215 c_ULTIMATE.start_main_~nodecount~4) 13) (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_215)) (<= 9 v_idx_215)) (or (= .cse11 (select c_ULTIMATE.start_main_~Source~4 v_idx_202)) (< (+ v_idx_202 c_ULTIMATE.start_main_~i~4) 15) (<= .cse2 v_idx_202)) (or (<= 13 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_177)) (= 27 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_177) c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_177) 27)) (or (< v_idx_205 .cse3) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_205) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_205) .cse11)) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_185) c_ULTIMATE.start_main_~i~4) 15) (<= .cse2 v_idx_185) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_185) 15)) (<= .cse12 c_ULTIMATE.start_main_~nodecount~4) (or (< v_idx_173 .cse11) (<= .cse4 v_idx_173) (= .cse11 (select c_ULTIMATE.start_main_~Weight~4 v_idx_173))) (or (<= 13 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_197)) (= .cse11 (select c_ULTIMATE.start_main_~Source~4 v_idx_197)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_197) 27)) (<= 5 c_ULTIMATE.start_main_~nodecount~4) (or (<= .cse13 v_idx_216) (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_216) 20)) (< v_idx_216 9)) (or (<= .cse10 v_idx_221) (< v_idx_221 .cse1) (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_221) 4) c_ULTIMATE.start_main_~nodecount~4)) (or (<= .cse1 v_idx_186) (< v_idx_186 .cse2) (= .cse2 (select c_ULTIMATE.start_main_~Weight~4 v_idx_186))) (or (<= 27 (+ v_idx_213 c_ULTIMATE.start_main_~edgecount~4)) (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_213)) (< (+ v_idx_213 c_ULTIMATE.start_main_~nodecount~4) 11)) (<= .cse14 25) (or (< (+ v_idx_199 10) c_ULTIMATE.start_main_~edgecount~4) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_199) 3) c_ULTIMATE.start_main_~nodecount~4) (<= 17 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_199))) (or (= v_v_8_1 (select c_ULTIMATE.start_main_~Source~4 v_idx_191)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_191 20))) (or (<= .cse3 v_idx_188) (< v_idx_188 .cse10) (= .cse10 (select c_ULTIMATE.start_main_~Weight~4 v_idx_188))) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_175) c_ULTIMATE.start_main_~edgecount~4) 25) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_175) 25) (<= 11 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_175))) (<= 5 .cse9) (or (< v_idx_190 c_ULTIMATE.start_main_~edgecount~4) (= v_v_187_1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_190))) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_208) 4) c_ULTIMATE.start_main_~nodecount~4) (< (+ v_idx_208 20) c_ULTIMATE.start_main_~edgecount~4) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_208 4))) (<= c_ULTIMATE.start_main_~edgecount~4 20) (<= c_ULTIMATE.start_main_~edgecount~4 .cse0) (or (< (+ v_idx_181 9) c_ULTIMATE.start_main_~edgecount~4) (<= 17 (+ v_idx_181 c_ULTIMATE.start_main_~nodecount~4)) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_181) 9) c_ULTIMATE.start_main_~edgecount~4)) (or (<= .cse13 v_idx_200) (= .cse11 (select c_ULTIMATE.start_main_~Source~4 v_idx_200)) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_200) 17)) (or (= v_v_128_1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_169)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_169 20))) (or (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_194) 4) c_ULTIMATE.start_main_~nodecount~4) (<= .cse4 v_idx_194) (< (+ v_idx_194 3) c_ULTIMATE.start_main_~nodecount~4)) (or (<= .cse1 v_idx_203) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_203) 4)) (< v_idx_203 .cse2)) (or (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_209)) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_209 3)) (< (+ v_idx_209 4) c_ULTIMATE.start_main_~nodecount~4)) (or (= v_v_127_1 (select c_ULTIMATE.start_main_~Dest~4 v_idx_224)) (< v_idx_224 c_ULTIMATE.start_main_~edgecount~4)) (or (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_210)) (< (+ v_idx_210 3) c_ULTIMATE.start_main_~nodecount~4) (<= .cse11 v_idx_210)) (<= 40 .cse15) (or (<= .cse13 v_idx_182) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_182) 17) (= 17 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_182)))) (or (<= .cse11 v_idx_172) (< (+ v_idx_172 3) c_ULTIMATE.start_main_~nodecount~4) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_172) 3))) (or (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_180) 10)) (< (+ v_idx_180 10) c_ULTIMATE.start_main_~edgecount~4) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_180 9))) (or (< v_idx_211 .cse11) (<= 25 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_211)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_211) 4))) (<= .cse15 40) (<= 20 .cse7) (or (< v_idx_217 .cse13) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_217) 3)) (<= 34 (+ v_idx_217 c_ULTIMATE.start_main_~edgecount~4))) (<= 25 .cse14) (or (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_196) 4) c_ULTIMATE.start_main_~nodecount~4) (<= 27 (+ v_idx_196 c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_196) 11)) (or (= (select c_ULTIMATE.start_main_~Weight~4 v_idx_183) .cse13) (< v_idx_183 .cse13) (<= 34 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_183))) (or (< (+ v_idx_218 c_ULTIMATE.start_main_~edgecount~4) 34) (= .cse11 (select c_ULTIMATE.start_main_~Dest~4 v_idx_218)) (<= 15 (+ v_idx_218 c_ULTIMATE.start_main_~i~4))) (<= 0 c_ULTIMATE.start_main_~i~4) (or (= (select c_ULTIMATE.start_main_~Weight~4 v_idx_189) .cse3) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_189) (< v_idx_189 .cse3)) (or (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_171 3)) (< (+ v_idx_171 4) c_ULTIMATE.start_main_~nodecount~4) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_171) 4) c_ULTIMATE.start_main_~nodecount~4)) (<= 10 .cse6) (or (<= 11 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_195)) (= c_ULTIMATE.start_main_~edgecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_195) 20)) (< v_idx_195 .cse4)) (or (<= 27 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_176)) (= 11 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_176))) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_176) 11)) (<= c_ULTIMATE.start_main_~i~4 0) (<= .cse8 c_ULTIMATE.start_main_~edgecount~4) (or (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_214)) (<= 13 (+ v_idx_214 c_ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_214 c_ULTIMATE.start_main_~edgecount~4) 27)) (or (< v_idx_201 .cse13) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_201) 20) c_ULTIMATE.start_main_~edgecount~4) (<= 15 (+ v_idx_201 c_ULTIMATE.start_main_~i~4))) (or (<= 11 (+ v_idx_212 c_ULTIMATE.start_main_~nodecount~4)) (= .cse4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_212)) (< (+ v_idx_212 c_ULTIMATE.start_main_~edgecount~4) 25)) (<= c_ULTIMATE.start_main_~nodecount~4 .cse12))))) is different from false [2019-01-11 14:42:08,706 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-01-11 14:42:08,707 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-11 14:42:08,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 14:42:08,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-11 14:42:08,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:42:08,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:42:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:42:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-01-11 14:42:08,711 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-01-11 14:50:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:50:40,648 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2019-01-11 14:50:40,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:50:40,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-11 14:50:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:50:40,649 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:50:40,650 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:50:40,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-01-11 14:50:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:50:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 14:50:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:50:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-11 14:50:40,658 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-01-11 14:50:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:50:40,658 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-11 14:50:40,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:50:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-11 14:50:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:50:40,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:50:40,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:50:40,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:50:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:50:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1948209421, now seen corresponding path program 1 times [2019-01-11 14:50:40,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:50:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:40,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:50:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:50:40,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:50:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:50:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:50:40,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:50:40,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:50:40,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:50:40,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:50:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:50:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:50:40,791 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2019-01-11 14:50:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:50:40,798 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-11 14:50:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:50:40,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-11 14:50:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:50:40,799 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:50:40,799 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:50:40,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-11 14:50:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:50:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:50:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:50:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:50:40,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-11 14:50:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:50:40,801 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:50:40,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:50:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:50:40,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:50:40,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:51:14,905 WARN L181 SmtUtils]: Spent 34.03 s on a formula simplification. DAG size of input: 497 DAG size of output: 497 [2019-01-11 14:51:14,962 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 176) no Hoare annotation was computed. [2019-01-11 14:51:14,962 INFO L444 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2019-01-11 14:51:14,964 INFO L444 ceAbstractionStarter]: At program point L114(lines 97 114) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~source~4) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4) (forall ((v_idx_191 Int) (v_idx_192 Int) (v_idx_190 Int) (v_idx_223 Int) (v_idx_224 Int) (v_idx_184 Int) (v_idx_185 Int) (v_idx_182 Int) (v_idx_183 Int) (v_idx_221 Int) (v_idx_188 Int) (v_idx_222 Int) (v_idx_189 Int) (v_idx_186 Int) (v_idx_220 Int) (v_idx_187 Int) (v_idx_180 Int) (v_idx_181 Int) (v_idx_214 Int) (v_idx_215 Int) (v_idx_179 Int) (v_idx_212 Int) (v_idx_213 Int) (v_idx_218 Int) (v_idx_219 Int) (v_idx_216 Int) (v_idx_217 Int) (v_idx_173 Int) (v_idx_174 Int) (v_idx_171 Int) (v_idx_172 Int) (v_idx_177 Int) (v_idx_210 Int) (v_idx_178 Int) (v_idx_211 Int) (v_idx_175 Int) (v_idx_176 Int) (v_idx_170 Int) (v_idx_209 Int) (v_idx_203 Int) (v_idx_204 Int) (v_idx_201 Int) (v_idx_202 Int) (v_idx_169 Int) (v_idx_207 Int) (v_idx_208 Int) (v_idx_205 Int) (v_idx_206 Int) (v_idx_200 Int) (v_idx_195 Int) (v_idx_196 Int) (v_idx_193 Int) (v_idx_194 Int) (v_idx_199 Int) (v_idx_197 Int) (v_idx_198 Int)) (exists ((v_v_8_1 Int) (v_v_67_1 Int) (v_v_68_1 Int) (v_v_127_1 Int) (v_v_128_1 Int) (v_v_187_1 Int)) (let ((.cse5 (* 2 ULTIMATE.start_main_~i~4)) (.cse10 (+ ULTIMATE.start_main_~i~4 18)) (.cse9 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~i~4)) (.cse0 (+ ULTIMATE.start_main_~nodecount~4 15)) (.cse1 (+ ULTIMATE.start_main_~i~4 17)) (.cse2 (+ ULTIMATE.start_main_~i~4 16)) (.cse15 (* 2 ULTIMATE.start_main_~edgecount~4)) (.cse7 (+ ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~edgecount~4)) (.cse14 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~edgecount~4)) (.cse11 (+ ULTIMATE.start_main_~i~4 3)) (.cse3 (+ ULTIMATE.start_main_~nodecount~4 14)) (.cse6 (* 2 ULTIMATE.start_main_~nodecount~4)) (.cse8 (+ ULTIMATE.start_main_~i~4 20)) (.cse13 (+ ULTIMATE.start_main_~nodecount~4 8)) (.cse4 (+ ULTIMATE.start_main_~i~4 4)) (.cse12 (+ ULTIMATE.start_main_~i~4 5))) (and (<= .cse0 ULTIMATE.start_main_~edgecount~4) (or (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_220) 3) ULTIMATE.start_main_~nodecount~4) (<= .cse1 v_idx_220) (< v_idx_220 .cse2)) (or (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_204) 3) ULTIMATE.start_main_~nodecount~4) (< v_idx_204 .cse1) (<= .cse3 v_idx_204)) (or (= .cse4 (select ULTIMATE.start_main_~Dest~4 v_idx_223)) (<= ULTIMATE.start_main_~edgecount~4 v_idx_223) (< v_idx_223 .cse3)) (or (= 34 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_184) ULTIMATE.start_main_~edgecount~4)) (< (+ v_idx_184 ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ ULTIMATE.start_main_~i~4 v_idx_184))) (<= 0 .cse5) (<= .cse5 0) (<= .cse6 10) (or (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_198) 13) (= .cse4 (select ULTIMATE.start_main_~Source~4 v_idx_198)) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_198 10))) (or (< v_idx_179 9) (= 9 (select ULTIMATE.start_main_~Weight~4 v_idx_179)) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_179 10))) (or (<= 25 (+ v_idx_174 ULTIMATE.start_main_~edgecount~4)) (= .cse4 (select ULTIMATE.start_main_~Weight~4 v_idx_174)) (< v_idx_174 .cse4)) (<= .cse7 20) (or (< (+ v_idx_219 ULTIMATE.start_main_~i~4) 15) (= ULTIMATE.start_main_~edgecount~4 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_219) 20)) (<= .cse2 v_idx_219)) (or (= ULTIMATE.start_main_~edgecount~4 (+ (select ULTIMATE.start_main_~Source~4 v_idx_192) 20)) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_192 4)) (< (+ v_idx_192 20) ULTIMATE.start_main_~edgecount~4)) (or (< v_idx_206 ULTIMATE.start_main_~edgecount~4) (= (select ULTIMATE.start_main_~Source~4 v_idx_206) v_v_67_1)) (or (= (select ULTIMATE.start_main_~Dest~4 v_idx_207) v_v_68_1) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_207 20))) (or (< (+ v_idx_193 4) ULTIMATE.start_main_~nodecount~4) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_193 3)) (= (select ULTIMATE.start_main_~Source~4 v_idx_193) .cse4)) (<= ULTIMATE.start_main_~edgecount~4 .cse8) (<= 20 ULTIMATE.start_main_~edgecount~4) (<= .cse9 5) (or (= .cse1 (select ULTIMATE.start_main_~Weight~4 v_idx_187)) (<= .cse10 v_idx_187) (< v_idx_187 .cse1)) (or (= ULTIMATE.start_main_~edgecount~4 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_170) 20)) (< (+ v_idx_170 20) ULTIMATE.start_main_~edgecount~4) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_170 4))) (<= ULTIMATE.start_main_~nodecount~4 5) (or (<= 9 v_idx_178) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_178) 13) (= 13 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_178) ULTIMATE.start_main_~nodecount~4))) (or (<= .cse3 v_idx_222) (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_222) 20) ULTIMATE.start_main_~edgecount~4) (< v_idx_222 .cse10)) (or (< (+ v_idx_215 ULTIMATE.start_main_~nodecount~4) 13) (= .cse11 (select ULTIMATE.start_main_~Dest~4 v_idx_215)) (<= 9 v_idx_215)) (or (= .cse11 (select ULTIMATE.start_main_~Source~4 v_idx_202)) (< (+ v_idx_202 ULTIMATE.start_main_~i~4) 15) (<= .cse2 v_idx_202)) (or (<= 13 (+ ULTIMATE.start_main_~nodecount~4 v_idx_177)) (= 27 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_177) ULTIMATE.start_main_~edgecount~4)) (< (+ ULTIMATE.start_main_~edgecount~4 v_idx_177) 27)) (or (< v_idx_205 .cse3) (<= ULTIMATE.start_main_~edgecount~4 v_idx_205) (= (select ULTIMATE.start_main_~Source~4 v_idx_205) .cse11)) (or (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_185) ULTIMATE.start_main_~i~4) 15) (<= .cse2 v_idx_185) (< (+ ULTIMATE.start_main_~i~4 v_idx_185) 15)) (<= .cse12 ULTIMATE.start_main_~nodecount~4) (or (< v_idx_173 .cse11) (<= .cse4 v_idx_173) (= .cse11 (select ULTIMATE.start_main_~Weight~4 v_idx_173))) (or (<= 13 (+ ULTIMATE.start_main_~nodecount~4 v_idx_197)) (= .cse11 (select ULTIMATE.start_main_~Source~4 v_idx_197)) (< (+ ULTIMATE.start_main_~edgecount~4 v_idx_197) 27)) (<= 5 ULTIMATE.start_main_~nodecount~4) (or (<= .cse13 v_idx_216) (= ULTIMATE.start_main_~edgecount~4 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_216) 20)) (< v_idx_216 9)) (or (<= .cse10 v_idx_221) (< v_idx_221 .cse1) (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_221) 4) ULTIMATE.start_main_~nodecount~4)) (or (<= .cse1 v_idx_186) (< v_idx_186 .cse2) (= .cse2 (select ULTIMATE.start_main_~Weight~4 v_idx_186))) (or (<= 27 (+ v_idx_213 ULTIMATE.start_main_~edgecount~4)) (= .cse11 (select ULTIMATE.start_main_~Dest~4 v_idx_213)) (< (+ v_idx_213 ULTIMATE.start_main_~nodecount~4) 11)) (<= .cse14 25) (or (< (+ v_idx_199 10) ULTIMATE.start_main_~edgecount~4) (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_199) 3) ULTIMATE.start_main_~nodecount~4) (<= 17 (+ ULTIMATE.start_main_~nodecount~4 v_idx_199))) (or (= v_v_8_1 (select ULTIMATE.start_main_~Source~4 v_idx_191)) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_191 20))) (or (<= .cse3 v_idx_188) (< v_idx_188 .cse10) (= .cse10 (select ULTIMATE.start_main_~Weight~4 v_idx_188))) (or (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_175) ULTIMATE.start_main_~edgecount~4) 25) (< (+ ULTIMATE.start_main_~edgecount~4 v_idx_175) 25) (<= 11 (+ ULTIMATE.start_main_~nodecount~4 v_idx_175))) (<= 5 .cse9) (or (< v_idx_190 ULTIMATE.start_main_~edgecount~4) (= v_v_187_1 (select ULTIMATE.start_main_~Weight~4 v_idx_190))) (or (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_208) 4) ULTIMATE.start_main_~nodecount~4) (< (+ v_idx_208 20) ULTIMATE.start_main_~edgecount~4) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_208 4))) (<= ULTIMATE.start_main_~edgecount~4 20) (<= ULTIMATE.start_main_~edgecount~4 .cse0) (or (< (+ v_idx_181 9) ULTIMATE.start_main_~edgecount~4) (<= 17 (+ v_idx_181 ULTIMATE.start_main_~nodecount~4)) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_181) 9) ULTIMATE.start_main_~edgecount~4)) (or (<= .cse13 v_idx_200) (= .cse11 (select ULTIMATE.start_main_~Source~4 v_idx_200)) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_200) 17)) (or (= v_v_128_1 (select ULTIMATE.start_main_~Weight~4 v_idx_169)) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_169 20))) (or (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_194) 4) ULTIMATE.start_main_~nodecount~4) (<= .cse4 v_idx_194) (< (+ v_idx_194 3) ULTIMATE.start_main_~nodecount~4)) (or (<= .cse1 v_idx_203) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Source~4 v_idx_203) 4)) (< v_idx_203 .cse2)) (or (= .cse11 (select ULTIMATE.start_main_~Dest~4 v_idx_209)) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_209 3)) (< (+ v_idx_209 4) ULTIMATE.start_main_~nodecount~4)) (or (= v_v_127_1 (select ULTIMATE.start_main_~Dest~4 v_idx_224)) (< v_idx_224 ULTIMATE.start_main_~edgecount~4)) (or (= .cse4 (select ULTIMATE.start_main_~Dest~4 v_idx_210)) (< (+ v_idx_210 3) ULTIMATE.start_main_~nodecount~4) (<= .cse11 v_idx_210)) (<= 40 .cse15) (or (<= .cse13 v_idx_182) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_182) 17) (= 17 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Weight~4 v_idx_182)))) (or (<= .cse11 v_idx_172) (< (+ v_idx_172 3) ULTIMATE.start_main_~nodecount~4) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_172) 3))) (or (= ULTIMATE.start_main_~edgecount~4 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_180) 10)) (< (+ v_idx_180 10) ULTIMATE.start_main_~edgecount~4) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_180 9))) (or (< v_idx_211 .cse11) (<= 25 (+ ULTIMATE.start_main_~edgecount~4 v_idx_211)) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_211) 4))) (<= .cse15 40) (<= 20 .cse7) (or (< v_idx_217 .cse13) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_217) 3)) (<= 34 (+ v_idx_217 ULTIMATE.start_main_~edgecount~4))) (<= 25 .cse14) (or (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_196) 4) ULTIMATE.start_main_~nodecount~4) (<= 27 (+ v_idx_196 ULTIMATE.start_main_~edgecount~4)) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_196) 11)) (or (= (select ULTIMATE.start_main_~Weight~4 v_idx_183) .cse13) (< v_idx_183 .cse13) (<= 34 (+ ULTIMATE.start_main_~edgecount~4 v_idx_183))) (or (< (+ v_idx_218 ULTIMATE.start_main_~edgecount~4) 34) (= .cse11 (select ULTIMATE.start_main_~Dest~4 v_idx_218)) (<= 15 (+ v_idx_218 ULTIMATE.start_main_~i~4))) (<= 0 ULTIMATE.start_main_~i~4) (or (= (select ULTIMATE.start_main_~Weight~4 v_idx_189) .cse3) (<= ULTIMATE.start_main_~edgecount~4 v_idx_189) (< v_idx_189 .cse3)) (or (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_171 3)) (< (+ v_idx_171 4) ULTIMATE.start_main_~nodecount~4) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_171) 4) ULTIMATE.start_main_~nodecount~4)) (<= 10 .cse6) (or (<= 11 (+ ULTIMATE.start_main_~nodecount~4 v_idx_195)) (= ULTIMATE.start_main_~edgecount~4 (+ (select ULTIMATE.start_main_~Source~4 v_idx_195) 20)) (< v_idx_195 .cse4)) (or (<= 27 (+ ULTIMATE.start_main_~edgecount~4 v_idx_176)) (= 11 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Weight~4 v_idx_176))) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_176) 11)) (<= ULTIMATE.start_main_~i~4 0) (<= .cse8 ULTIMATE.start_main_~edgecount~4) (or (= .cse4 (select ULTIMATE.start_main_~Dest~4 v_idx_214)) (<= 13 (+ v_idx_214 ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_214 ULTIMATE.start_main_~edgecount~4) 27)) (or (< v_idx_201 .cse13) (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_201) 20) ULTIMATE.start_main_~edgecount~4) (<= 15 (+ v_idx_201 ULTIMATE.start_main_~i~4))) (or (<= 11 (+ v_idx_212 ULTIMATE.start_main_~nodecount~4)) (= .cse4 (select ULTIMATE.start_main_~Dest~4 v_idx_212)) (< (+ v_idx_212 ULTIMATE.start_main_~edgecount~4) 25)) (<= ULTIMATE.start_main_~nodecount~4 .cse12)))))) [2019-01-11 14:51:14,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 176) no Hoare annotation was computed. [2019-01-11 14:51:14,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2019-01-11 14:51:14,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) no Hoare annotation was computed. [2019-01-11 14:51:14,965 INFO L444 ceAbstractionStarter]: At program point L144(lines 123 145) the Hoare annotation is: false [2019-01-11 14:51:14,965 INFO L444 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2019-01-11 14:51:14,965 INFO L444 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2019-01-11 14:51:15,006 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:51:15 BoogieIcfgContainer [2019-01-11 14:51:15,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:51:15,007 INFO L168 Benchmark]: Toolchain (without parser) took 853257.24 ms. Allocated memory was 139.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 106.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 722.5 MB. Max. memory is 7.1 GB. [2019-01-11 14:51:15,010 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:51:15,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.75 ms. Allocated memory is still 139.5 MB. Free memory was 106.3 MB in the beginning and 104.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-01-11 14:51:15,012 INFO L168 Benchmark]: Boogie Preprocessor took 54.63 ms. Allocated memory is still 139.5 MB. Free memory was 104.8 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:51:15,015 INFO L168 Benchmark]: RCFGBuilder took 512.12 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 90.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-01-11 14:51:15,016 INFO L168 Benchmark]: TraceAbstraction took 852638.72 ms. Allocated memory was 139.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 90.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 706.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:51:15,020 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.75 ms. Allocated memory is still 139.5 MB. Free memory was 106.3 MB in the beginning and 104.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.63 ms. Allocated memory is still 139.5 MB. Free memory was 104.8 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 512.12 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 90.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 852638.72 ms. Allocated memory was 139.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 90.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 706.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 123]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (main_~i~4 <= main_~source~4 && main_~source~4 <= main_~i~4) && (forall v_idx_191 : int, v_idx_192 : int, v_idx_190 : int, v_idx_223 : int, v_idx_224 : int, v_idx_184 : int, v_idx_185 : int, v_idx_182 : int, v_idx_183 : int, v_idx_221 : int, v_idx_188 : int, v_idx_222 : int, v_idx_189 : int, v_idx_186 : int, v_idx_220 : int, v_idx_187 : int, v_idx_180 : int, v_idx_181 : int, v_idx_214 : int, v_idx_215 : int, v_idx_179 : int, v_idx_212 : int, v_idx_213 : int, v_idx_218 : int, v_idx_219 : int, v_idx_216 : int, v_idx_217 : int, v_idx_173 : int, v_idx_174 : int, v_idx_171 : int, v_idx_172 : int, v_idx_177 : int, v_idx_210 : int, v_idx_178 : int, v_idx_211 : int, v_idx_175 : int, v_idx_176 : int, v_idx_170 : int, v_idx_209 : int, v_idx_203 : int, v_idx_204 : int, v_idx_201 : int, v_idx_202 : int, v_idx_169 : int, v_idx_207 : int, v_idx_208 : int, v_idx_205 : int, v_idx_206 : int, v_idx_200 : int, v_idx_195 : int, v_idx_196 : int, v_idx_193 : int, v_idx_194 : int, v_idx_199 : int, v_idx_197 : int, v_idx_198 : int :: (exists v_v_8_1 : int, v_v_67_1 : int, v_v_68_1 : int, v_v_127_1 : int, v_v_128_1 : int, v_v_187_1 : int :: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~nodecount~4 + 15 <= main_~edgecount~4 && ((main_~Dest~4[v_idx_220] + 3 == main_~nodecount~4 || main_~i~4 + 17 <= v_idx_220) || v_idx_220 < main_~i~4 + 16)) && ((main_~Source~4[v_idx_204] + 3 == main_~nodecount~4 || v_idx_204 < main_~i~4 + 17) || main_~nodecount~4 + 14 <= v_idx_204)) && ((main_~i~4 + 4 == main_~Dest~4[v_idx_223] || main_~edgecount~4 <= v_idx_223) || v_idx_223 < main_~nodecount~4 + 14)) && ((34 == main_~Weight~4[v_idx_184] + main_~edgecount~4 || v_idx_184 + main_~edgecount~4 < 34) || 15 <= main_~i~4 + v_idx_184)) && 0 <= 2 * main_~i~4) && 2 * main_~i~4 <= 0) && 2 * main_~nodecount~4 <= 10) && ((main_~nodecount~4 + v_idx_198 < 13 || main_~i~4 + 4 == main_~Source~4[v_idx_198]) || main_~edgecount~4 <= v_idx_198 + 10)) && ((v_idx_179 < 9 || 9 == main_~Weight~4[v_idx_179]) || main_~edgecount~4 <= v_idx_179 + 10)) && ((25 <= v_idx_174 + main_~edgecount~4 || main_~i~4 + 4 == main_~Weight~4[v_idx_174]) || v_idx_174 < main_~i~4 + 4)) && main_~i~4 + main_~edgecount~4 <= 20) && ((v_idx_219 + main_~i~4 < 15 || main_~edgecount~4 == main_~Dest~4[v_idx_219] + 20) || main_~i~4 + 16 <= v_idx_219)) && ((main_~edgecount~4 == main_~Source~4[v_idx_192] + 20 || main_~nodecount~4 <= v_idx_192 + 4) || v_idx_192 + 20 < main_~edgecount~4)) && (v_idx_206 < main_~edgecount~4 || main_~Source~4[v_idx_206] == v_v_67_1)) && (main_~Dest~4[v_idx_207] == v_v_68_1 || main_~edgecount~4 <= v_idx_207 + 20)) && ((v_idx_193 + 4 < main_~nodecount~4 || main_~nodecount~4 <= v_idx_193 + 3) || main_~Source~4[v_idx_193] == main_~i~4 + 4)) && main_~edgecount~4 <= main_~i~4 + 20) && 20 <= main_~edgecount~4) && main_~nodecount~4 + main_~i~4 <= 5) && ((main_~i~4 + 17 == main_~Weight~4[v_idx_187] || main_~i~4 + 18 <= v_idx_187) || v_idx_187 < main_~i~4 + 17)) && ((main_~edgecount~4 == main_~Weight~4[v_idx_170] + 20 || v_idx_170 + 20 < main_~edgecount~4) || main_~nodecount~4 <= v_idx_170 + 4)) && main_~nodecount~4 <= 5) && ((9 <= v_idx_178 || main_~nodecount~4 + v_idx_178 < 13) || 13 == main_~Weight~4[v_idx_178] + main_~nodecount~4)) && ((main_~nodecount~4 + 14 <= v_idx_222 || main_~Dest~4[v_idx_222] + 20 == main_~edgecount~4) || v_idx_222 < main_~i~4 + 18)) && ((v_idx_215 + main_~nodecount~4 < 13 || main_~i~4 + 3 == main_~Dest~4[v_idx_215]) || 9 <= v_idx_215)) && ((main_~i~4 + 3 == main_~Source~4[v_idx_202] || v_idx_202 + main_~i~4 < 15) || main_~i~4 + 16 <= v_idx_202)) && ((13 <= main_~nodecount~4 + v_idx_177 || 27 == main_~Weight~4[v_idx_177] + main_~edgecount~4) || main_~edgecount~4 + v_idx_177 < 27)) && ((v_idx_205 < main_~nodecount~4 + 14 || main_~edgecount~4 <= v_idx_205) || main_~Source~4[v_idx_205] == main_~i~4 + 3)) && ((main_~Weight~4[v_idx_185] + main_~i~4 == 15 || main_~i~4 + 16 <= v_idx_185) || main_~i~4 + v_idx_185 < 15)) && main_~i~4 + 5 <= main_~nodecount~4) && ((v_idx_173 < main_~i~4 + 3 || main_~i~4 + 4 <= v_idx_173) || main_~i~4 + 3 == main_~Weight~4[v_idx_173])) && ((13 <= main_~nodecount~4 + v_idx_197 || main_~i~4 + 3 == main_~Source~4[v_idx_197]) || main_~edgecount~4 + v_idx_197 < 27)) && 5 <= main_~nodecount~4) && ((main_~nodecount~4 + 8 <= v_idx_216 || main_~edgecount~4 == main_~Dest~4[v_idx_216] + 20) || v_idx_216 < 9)) && ((main_~i~4 + 18 <= v_idx_221 || v_idx_221 < main_~i~4 + 17) || main_~Dest~4[v_idx_221] + 4 == main_~nodecount~4)) && ((main_~i~4 + 17 <= v_idx_186 || v_idx_186 < main_~i~4 + 16) || main_~i~4 + 16 == main_~Weight~4[v_idx_186])) && ((27 <= v_idx_213 + main_~edgecount~4 || main_~i~4 + 3 == main_~Dest~4[v_idx_213]) || v_idx_213 + main_~nodecount~4 < 11)) && main_~nodecount~4 + main_~edgecount~4 <= 25) && ((v_idx_199 + 10 < main_~edgecount~4 || main_~Source~4[v_idx_199] + 3 == main_~nodecount~4) || 17 <= main_~nodecount~4 + v_idx_199)) && (v_v_8_1 == main_~Source~4[v_idx_191] || main_~edgecount~4 <= v_idx_191 + 20)) && ((main_~nodecount~4 + 14 <= v_idx_188 || v_idx_188 < main_~i~4 + 18) || main_~i~4 + 18 == main_~Weight~4[v_idx_188])) && ((main_~Weight~4[v_idx_175] + main_~edgecount~4 == 25 || main_~edgecount~4 + v_idx_175 < 25) || 11 <= main_~nodecount~4 + v_idx_175)) && 5 <= main_~nodecount~4 + main_~i~4) && (v_idx_190 < main_~edgecount~4 || v_v_187_1 == main_~Weight~4[v_idx_190])) && ((main_~Dest~4[v_idx_208] + 4 == main_~nodecount~4 || v_idx_208 + 20 < main_~edgecount~4) || main_~nodecount~4 <= v_idx_208 + 4)) && main_~edgecount~4 <= 20) && main_~edgecount~4 <= main_~nodecount~4 + 15) && ((v_idx_181 + 9 < main_~edgecount~4 || 17 <= v_idx_181 + main_~nodecount~4) || main_~Weight~4[v_idx_181] + 9 == main_~edgecount~4)) && ((main_~nodecount~4 + 8 <= v_idx_200 || main_~i~4 + 3 == main_~Source~4[v_idx_200]) || main_~nodecount~4 + v_idx_200 < 17)) && (v_v_128_1 == main_~Weight~4[v_idx_169] || main_~edgecount~4 <= v_idx_169 + 20)) && ((main_~Source~4[v_idx_194] + 4 == main_~nodecount~4 || main_~i~4 + 4 <= v_idx_194) || v_idx_194 + 3 < main_~nodecount~4)) && ((main_~i~4 + 17 <= v_idx_203 || main_~nodecount~4 == main_~Source~4[v_idx_203] + 4) || v_idx_203 < main_~i~4 + 16)) && ((main_~i~4 + 3 == main_~Dest~4[v_idx_209] || main_~nodecount~4 <= v_idx_209 + 3) || v_idx_209 + 4 < main_~nodecount~4)) && (v_v_127_1 == main_~Dest~4[v_idx_224] || v_idx_224 < main_~edgecount~4)) && ((main_~i~4 + 4 == main_~Dest~4[v_idx_210] || v_idx_210 + 3 < main_~nodecount~4) || main_~i~4 + 3 <= v_idx_210)) && 40 <= 2 * main_~edgecount~4) && ((main_~nodecount~4 + 8 <= v_idx_182 || main_~nodecount~4 + v_idx_182 < 17) || 17 == main_~nodecount~4 + main_~Weight~4[v_idx_182])) && ((main_~i~4 + 3 <= v_idx_172 || v_idx_172 + 3 < main_~nodecount~4) || main_~nodecount~4 == main_~Weight~4[v_idx_172] + 3)) && ((main_~edgecount~4 == main_~Weight~4[v_idx_180] + 10 || v_idx_180 + 10 < main_~edgecount~4) || main_~edgecount~4 <= v_idx_180 + 9)) && ((v_idx_211 < main_~i~4 + 3 || 25 <= main_~edgecount~4 + v_idx_211) || main_~nodecount~4 == main_~Dest~4[v_idx_211] + 4)) && 2 * main_~edgecount~4 <= 40) && 20 <= main_~i~4 + main_~edgecount~4) && ((v_idx_217 < main_~nodecount~4 + 8 || main_~nodecount~4 == main_~Dest~4[v_idx_217] + 3) || 34 <= v_idx_217 + main_~edgecount~4)) && 25 <= main_~nodecount~4 + main_~edgecount~4) && ((main_~Source~4[v_idx_196] + 4 == main_~nodecount~4 || 27 <= v_idx_196 + main_~edgecount~4) || main_~nodecount~4 + v_idx_196 < 11)) && ((main_~Weight~4[v_idx_183] == main_~nodecount~4 + 8 || v_idx_183 < main_~nodecount~4 + 8) || 34 <= main_~edgecount~4 + v_idx_183)) && ((v_idx_218 + main_~edgecount~4 < 34 || main_~i~4 + 3 == main_~Dest~4[v_idx_218]) || 15 <= v_idx_218 + main_~i~4)) && 0 <= main_~i~4) && ((main_~Weight~4[v_idx_189] == main_~nodecount~4 + 14 || main_~edgecount~4 <= v_idx_189) || v_idx_189 < main_~nodecount~4 + 14)) && ((main_~nodecount~4 <= v_idx_171 + 3 || v_idx_171 + 4 < main_~nodecount~4) || main_~Weight~4[v_idx_171] + 4 == main_~nodecount~4)) && 10 <= 2 * main_~nodecount~4) && ((11 <= main_~nodecount~4 + v_idx_195 || main_~edgecount~4 == main_~Source~4[v_idx_195] + 20) || v_idx_195 < main_~i~4 + 4)) && ((27 <= main_~edgecount~4 + v_idx_176 || 11 == main_~nodecount~4 + main_~Weight~4[v_idx_176]) || main_~nodecount~4 + v_idx_176 < 11)) && main_~i~4 <= 0) && main_~i~4 + 20 <= main_~edgecount~4) && ((main_~i~4 + 4 == main_~Dest~4[v_idx_214] || 13 <= v_idx_214 + main_~nodecount~4) || v_idx_214 + main_~edgecount~4 < 27)) && ((v_idx_201 < main_~nodecount~4 + 8 || main_~Source~4[v_idx_201] + 20 == main_~edgecount~4) || 15 <= v_idx_201 + main_~i~4)) && ((11 <= v_idx_212 + main_~nodecount~4 || main_~i~4 + 4 == main_~Dest~4[v_idx_212]) || v_idx_212 + main_~edgecount~4 < 25)) && main_~nodecount~4 <= main_~i~4 + 5)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 852.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 512.1s AutomataDifference, 0.0s DeadEndRemovalTime, 34.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 1 SDs, 0 SdLazy, 13 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 509.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 296.5s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 1066 HoareAnnotationTreeSize, 5 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 34.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...