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-f57a05f [2019-01-08 14:18:35,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:18:35,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:18:35,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:18:35,571 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:18:35,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:18:35,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:18:35,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:18:35,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:18:35,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:18:35,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:18:35,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:18:35,583 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:18:35,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:18:35,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:18:35,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:18:35,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:18:35,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:18:35,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:18:35,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:18:35,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:18:35,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:18:35,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:18:35,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:18:35,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:18:35,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:18:35,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:18:35,600 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:18:35,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:18:35,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:18:35,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:18:35,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:18:35,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:18:35,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:18:35,605 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:18:35,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:18:35,606 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-08 14:18:35,626 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:18:35,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:18:35,628 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:18:35,628 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:18:35,628 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:18:35,628 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:18:35,628 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:18:35,629 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:18:35,629 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:18:35,629 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:18:35,629 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:18:35,629 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:18:35,630 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:18:35,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:18:35,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:18:35,631 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:18:35,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:18:35,633 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:18:35,633 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:18:35,633 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:18:35,633 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:18:35,634 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:18:35,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:18:35,634 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:18:35,634 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:18:35,634 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:18:35,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:18:35,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:18:35,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:18:35,635 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:18:35,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:35,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:18:35,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:18:35,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:18:35,636 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:18:35,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:18:35,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:18:35,638 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:18:35,639 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:18:35,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:18:35,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:18:35,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:18:35,700 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:18:35,701 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:18:35,701 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-08 14:18:35,702 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-01-08 14:18:35,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:18:35,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:18:35,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:35,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:18:35,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:18:35,771 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,785 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:35,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:18:35,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:18:35,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:18:35,807 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,808 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,811 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,811 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,819 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,821 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,823 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 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:18:35,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:18:35,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:18:35,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:18:35,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (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-08 14:18:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:18:35,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:18:36,258 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:18:36,258 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-08 14:18:36,261 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36 BoogieIcfgContainer [2019-01-08 14:18:36,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:18:36,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:18:36,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:18:36,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:18:36,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/2) ... [2019-01-08 14:18:36,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f82c43 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:18:36, skipping insertion in model container [2019-01-08 14:18:36,271 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 08.01 02:18:36" (2/2) ... [2019-01-08 14:18:36,274 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-01-08 14:18:36,287 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:18:36,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 14:18:36,360 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 14:18:36,431 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:18:36,431 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:18:36,431 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:18:36,431 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:18:36,432 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:18:36,432 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:18:36,432 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:18:36,432 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:18:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-08 14:18:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:18:36,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:36,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:18:36,474 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-01-08 14:18:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:36,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:36,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:36,915 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-08 14:18:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:18:36,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:18:36,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:36,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:18:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:18:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:18:36,944 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-01-08 14:18:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:37,201 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-01-08 14:18:37,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:18:37,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:18:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:37,215 INFO L225 Difference]: With dead ends: 15 [2019-01-08 14:18:37,215 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 14:18:37,219 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-08 14:18:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 14:18:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-08 14:18:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 14:18:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-08 14:18:37,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-01-08 14:18:37,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:37,260 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-08 14:18:37,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:18:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-01-08 14:18:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:18:37,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:37,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:18:37,262 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:37,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-01-08 14:18:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:37,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:37,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:37,446 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-08 14:18:37,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:37,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:37,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:18:37,449 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-01-08 14:18:37,540 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:18:37,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:22:57,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-08 14:22:57,162 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2019-01-08 14:22:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:57,168 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-08 14:23:02,881 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 25% of their original sizes. [2019-01-08 14:23:02,881 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-08 14:23:06,122 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_189 Int) (v_idx_222 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_212 Int) (v_idx_179 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_211 Int) (v_idx_178 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 ((.cse2 (* 2 c_ULTIMATE.start_main_~i~4)) (.cse7 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~i~4)) (.cse8 (+ c_ULTIMATE.start_main_~i~4 15)) (.cse11 (+ c_ULTIMATE.start_main_~i~4 14)) (.cse0 (+ c_ULTIMATE.start_main_~nodecount~4 15)) (.cse14 (* 2 c_ULTIMATE.start_main_~edgecount~4)) (.cse5 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse12 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse4 (* 2 c_ULTIMATE.start_main_~nodecount~4)) (.cse6 (+ c_ULTIMATE.start_main_~i~4 20)) (.cse10 (+ c_ULTIMATE.start_main_~i~4 9)) (.cse9 (+ c_ULTIMATE.start_main_~i~4 5))) (and (<= .cse0 c_ULTIMATE.start_main_~edgecount~4) (or (= (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_221)) 1) (<= 18 v_idx_221) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_221) 37)) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_207) v_v_68_1) (<= 0 v_idx_207)) (let ((.cse1 (+ c_ULTIMATE.start_main_~i~4 v_idx_197))) (or (<= 8 .cse1) (< .cse1 7) (= 8 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Source~4 v_idx_197))))) (<= 0 .cse2) (let ((.cse3 (+ v_idx_214 c_ULTIMATE.start_main_~i~4))) (or (< .cse3 7) (<= 8 .cse3) (= 4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_214)))) (or (<= 1 (+ v_idx_192 c_ULTIMATE.start_main_~i~4)) (< v_idx_192 0) (= 0 (select c_ULTIMATE.start_main_~Source~4 v_idx_192))) (<= .cse2 0) (<= .cse4 10) (or (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_173) 8) (= 8 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_173))) (<= 4 v_idx_173)) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_180) c_ULTIMATE.start_main_~i~4) 10) (< (+ v_idx_180 c_ULTIMATE.start_main_~i~4) 10) (<= 16 (+ v_idx_180 c_ULTIMATE.start_main_~nodecount~4))) (<= .cse5 20) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_220) 2) (<= 37 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_220)) (< v_idx_220 16)) (or (= 8 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_213))) (< v_idx_213 6) (<= 7 (+ v_idx_213 c_ULTIMATE.start_main_~i~4))) (or (= 6 (select c_ULTIMATE.start_main_~Weight~4 v_idx_176)) (< v_idx_176 6) (<= 7 (+ c_ULTIMATE.start_main_~i~4 v_idx_176))) (or (= 4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_212)) (< (+ v_idx_212 15) c_ULTIMATE.start_main_~edgecount~4) (<= 6 v_idx_212)) (<= c_ULTIMATE.start_main_~edgecount~4 .cse6) (<= 20 c_ULTIMATE.start_main_~edgecount~4) (<= .cse7 5) (or (< v_idx_202 .cse8) (<= 16 v_idx_202) (= 8 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Source~4 v_idx_202)))) (<= c_ULTIMATE.start_main_~nodecount~4 5) (or (<= 37 (+ v_idx_203 c_ULTIMATE.start_main_~edgecount~4)) (= 1 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_203) c_ULTIMATE.start_main_~i~4)) (< v_idx_203 16)) (or (= 0 (select c_ULTIMATE.start_main_~Source~4 v_idx_195)) (< v_idx_195 4) (<= 6 v_idx_195)) (or (= (select c_ULTIMATE.start_main_~Source~4 v_idx_193) 4) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_193) 1) (<= 2 v_idx_193)) (or (< (+ v_idx_204 c_ULTIMATE.start_main_~edgecount~4) 37) (<= 24 (+ v_idx_204 c_ULTIMATE.start_main_~nodecount~4)) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_204) 2)) (or (<= 13 (+ c_ULTIMATE.start_main_~i~4 v_idx_182)) (= 12 (select c_ULTIMATE.start_main_~Weight~4 v_idx_182)) (< v_idx_182 12)) (or (= 24 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_189) c_ULTIMATE.start_main_~nodecount~4)) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_189) 24) (<= 20 v_idx_189)) (or (<= 24 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_188)) (< v_idx_188 18) (= 18 (select c_ULTIMATE.start_main_~Weight~4 v_idx_188))) (<= .cse9 c_ULTIMATE.start_main_~nodecount~4) (or (<= 20 v_idx_205) (= (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Source~4 v_idx_205)) 8) (< (+ v_idx_205 c_ULTIMATE.start_main_~nodecount~4) 24)) (or (< v_idx_216 .cse10) (<= 13 (+ v_idx_216 c_ULTIMATE.start_main_~i~4)) (= 0 (select c_ULTIMATE.start_main_~Dest~4 v_idx_216))) (or (< (+ v_idx_201 c_ULTIMATE.start_main_~i~4) 13) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_201) 0) (<= .cse8 v_idx_201)) (or (< (+ c_ULTIMATE.start_main_~i~4 v_idx_178) 8) (= 8 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_178) c_ULTIMATE.start_main_~i~4)) (<= .cse10 v_idx_178)) (or (< v_idx_184 .cse11) (= (select c_ULTIMATE.start_main_~Weight~4 v_idx_184) .cse11) (<= .cse8 v_idx_184)) (<= 5 c_ULTIMATE.start_main_~nodecount~4) (or (<= .cse11 v_idx_217) (= 2 (select c_ULTIMATE.start_main_~Dest~4 v_idx_217)) (< (+ v_idx_217 c_ULTIMATE.start_main_~i~4) 13)) (<= .cse12 25) (or (<= 2 v_idx_209) (= 8 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_209) c_ULTIMATE.start_main_~nodecount~4)) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_209) 1)) (or (< v_idx_206 20) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_206) v_v_67_1)) (or (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_211 15)) (= (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_211)) 1) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_211) 8)) (or (= 0 (select c_ULTIMATE.start_main_~Dest~4 v_idx_219)) (<= 16 v_idx_219) (< v_idx_219 .cse8)) (or (<= .cse11 v_idx_183) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_183) 13) (= 13 (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_183)))) (or (= 2 (select c_ULTIMATE.start_main_~Weight~4 v_idx_172)) (<= 8 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_172)) (< v_idx_172 2)) (<= 5 .cse7) (or (<= 13 (+ c_ULTIMATE.start_main_~i~4 v_idx_200)) (= 8 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_200) c_ULTIMATE.start_main_~nodecount~4)) (< v_idx_200 12)) (or (<= 10 (+ v_idx_179 c_ULTIMATE.start_main_~i~4)) (< v_idx_179 .cse10) (= .cse10 (select c_ULTIMATE.start_main_~Weight~4 v_idx_179))) (or (<= 12 v_idx_181) (< (+ v_idx_181 c_ULTIMATE.start_main_~nodecount~4) 16) (= 16 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_181)))) (let ((.cse13 (+ c_ULTIMATE.start_main_~i~4 v_idx_198))) (or (= 4 (select c_ULTIMATE.start_main_~Source~4 v_idx_198)) (<= 10 .cse13) (< .cse13 8))) (or (= 2 (select c_ULTIMATE.start_main_~Source~4 v_idx_199)) (<= 12 v_idx_199) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_199) 10)) (or (< v_idx_185 .cse8) (= .cse8 (select c_ULTIMATE.start_main_~Weight~4 v_idx_185)) (<= 16 v_idx_185)) (or (<= .cse8 v_idx_218) (= 8 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_218) c_ULTIMATE.start_main_~nodecount~4)) (< v_idx_218 .cse11)) (<= c_ULTIMATE.start_main_~edgecount~4 20) (or (< v_idx_190 20) (= v_v_187_1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_190))) (or (< (+ v_idx_223 c_ULTIMATE.start_main_~nodecount~4) 24) (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_223) 4) (<= 20 v_idx_223)) (<= c_ULTIMATE.start_main_~edgecount~4 .cse0) (or (= v_v_127_1 (select c_ULTIMATE.start_main_~Dest~4 v_idx_224)) (< v_idx_224 20)) (or (<= 2 v_idx_171) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_171) 1) (= (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_171)) 1)) (or (= v_v_8_1 (select c_ULTIMATE.start_main_~Source~4 v_idx_191)) (<= 0 v_idx_191)) (<= 40 .cse14) (let ((.cse15 (+ c_ULTIMATE.start_main_~i~4 v_idx_177))) (or (<= 8 .cse15) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_177) c_ULTIMATE.start_main_~i~4) 7) (< .cse15 7))) (<= .cse14 40) (or (<= 1 (+ v_idx_170 c_ULTIMATE.start_main_~i~4)) (< v_idx_170 0) (= 0 (select c_ULTIMATE.start_main_~Weight~4 v_idx_170))) (or (<= 4 v_idx_194) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_194) c_ULTIMATE.start_main_~i~4) 1) (< v_idx_194 2)) (<= 20 .cse5) (or (= 37 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_187) c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_187) 37) (<= 18 v_idx_187)) (<= 25 .cse12) (<= 0 c_ULTIMATE.start_main_~i~4) (or (<= 8 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_210)) (= 4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_210)) (< v_idx_210 2)) (or (= (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Source~4 v_idx_196)) 1) (< v_idx_196 6) (<= 7 (+ c_ULTIMATE.start_main_~i~4 v_idx_196))) (or (<= 0 v_idx_169) (= v_v_128_1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_169))) (<= 10 .cse4) (or (<= 37 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_186)) (< v_idx_186 16) (= 16 (select c_ULTIMATE.start_main_~Weight~4 v_idx_186))) (<= c_ULTIMATE.start_main_~i~4 0) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_222) 0) (< v_idx_222 18) (<= 24 (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_222))) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_208) c_ULTIMATE.start_main_~i~4) 1) (< v_idx_208 0) (<= 1 (+ v_idx_208 c_ULTIMATE.start_main_~i~4))) (<= .cse6 c_ULTIMATE.start_main_~edgecount~4) (or (<= 6 v_idx_175) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_175) 15) c_ULTIMATE.start_main_~edgecount~4) (< (+ v_idx_175 15) c_ULTIMATE.start_main_~edgecount~4)) (or (< (+ v_idx_215 c_ULTIMATE.start_main_~i~4) 8) (= 8 (+ c_ULTIMATE.start_main_~nodecount~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_215))) (<= .cse10 v_idx_215)) (or (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_174 15)) (= 4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_174)) (< v_idx_174 4)) (<= c_ULTIMATE.start_main_~nodecount~4 .cse9))))) is different from false [2019-01-08 14:23:06,146 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-01-08 14:23:06,147 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-08 14:23:06,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-08 14:23:06,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-08 14:23:06,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:23:06,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:23:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:23:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-01-08 14:23:06,151 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-01-08 14:32:14,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:32:14,308 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2019-01-08 14:32:14,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:32:14,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-08 14:32:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:32:14,310 INFO L225 Difference]: With dead ends: 15 [2019-01-08 14:32:14,310 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 14:32:14,311 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-08 14:32:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 14:32:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 14:32:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 14:32:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-08 14:32:14,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-01-08 14:32:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:32:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-08 14:32:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:32:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-08 14:32:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 14:32:14,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:32:14,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:32:14,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:32:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:32:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1948209421, now seen corresponding path program 1 times [2019-01-08 14:32:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:32:14,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:32:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:32:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:32:14,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:32:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:32:14,416 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-08 14:32:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:32:14,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:32:14,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:32:14,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:32:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:32:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:32:14,418 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 3 states. [2019-01-08 14:32:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:32:14,432 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-08 14:32:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:32:14,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-08 14:32:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:32:14,432 INFO L225 Difference]: With dead ends: 9 [2019-01-08 14:32:14,433 INFO L226 Difference]: Without dead ends: 0 [2019-01-08 14:32:14,433 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-08 14:32:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-08 14:32:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-08 14:32:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-08 14:32:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-08 14:32:14,434 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-08 14:32:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:32:14,434 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-08 14:32:14,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:32:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-08 14:32:14,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-08 14:32:14,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-08 14:32:48,662 WARN L181 SmtUtils]: Spent 34.17 s on a formula simplification. DAG size of input: 476 DAG size of output: 476 [2019-01-08 14:32:48,718 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 176) no Hoare annotation was computed. [2019-01-08 14:32:48,719 INFO L444 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2019-01-08 14:32:48,723 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_189 Int) (v_idx_222 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_212 Int) (v_idx_179 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_211 Int) (v_idx_178 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 ((.cse2 (* 2 ULTIMATE.start_main_~i~4)) (.cse7 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~i~4)) (.cse8 (+ ULTIMATE.start_main_~i~4 15)) (.cse11 (+ ULTIMATE.start_main_~i~4 14)) (.cse0 (+ ULTIMATE.start_main_~nodecount~4 15)) (.cse14 (* 2 ULTIMATE.start_main_~edgecount~4)) (.cse5 (+ ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~edgecount~4)) (.cse12 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~edgecount~4)) (.cse4 (* 2 ULTIMATE.start_main_~nodecount~4)) (.cse6 (+ ULTIMATE.start_main_~i~4 20)) (.cse10 (+ ULTIMATE.start_main_~i~4 9)) (.cse9 (+ ULTIMATE.start_main_~i~4 5))) (and (<= .cse0 ULTIMATE.start_main_~edgecount~4) (or (= (+ ULTIMATE.start_main_~i~4 (select ULTIMATE.start_main_~Dest~4 v_idx_221)) 1) (<= 18 v_idx_221) (< (+ ULTIMATE.start_main_~edgecount~4 v_idx_221) 37)) (or (= (select ULTIMATE.start_main_~Dest~4 v_idx_207) v_v_68_1) (<= 0 v_idx_207)) (let ((.cse1 (+ ULTIMATE.start_main_~i~4 v_idx_197))) (or (<= 8 .cse1) (< .cse1 7) (= 8 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Source~4 v_idx_197))))) (<= 0 .cse2) (let ((.cse3 (+ v_idx_214 ULTIMATE.start_main_~i~4))) (or (< .cse3 7) (<= 8 .cse3) (= 4 (select ULTIMATE.start_main_~Dest~4 v_idx_214)))) (or (<= 1 (+ v_idx_192 ULTIMATE.start_main_~i~4)) (< v_idx_192 0) (= 0 (select ULTIMATE.start_main_~Source~4 v_idx_192))) (<= .cse2 0) (<= .cse4 10) (or (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_173) 8) (= 8 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Weight~4 v_idx_173))) (<= 4 v_idx_173)) (or (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_180) ULTIMATE.start_main_~i~4) 10) (< (+ v_idx_180 ULTIMATE.start_main_~i~4) 10) (<= 16 (+ v_idx_180 ULTIMATE.start_main_~nodecount~4))) (<= .cse5 20) (or (= (select ULTIMATE.start_main_~Dest~4 v_idx_220) 2) (<= 37 (+ ULTIMATE.start_main_~edgecount~4 v_idx_220)) (< v_idx_220 16)) (or (= 8 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Dest~4 v_idx_213))) (< v_idx_213 6) (<= 7 (+ v_idx_213 ULTIMATE.start_main_~i~4))) (or (= 6 (select ULTIMATE.start_main_~Weight~4 v_idx_176)) (< v_idx_176 6) (<= 7 (+ ULTIMATE.start_main_~i~4 v_idx_176))) (or (= 4 (select ULTIMATE.start_main_~Dest~4 v_idx_212)) (< (+ v_idx_212 15) ULTIMATE.start_main_~edgecount~4) (<= 6 v_idx_212)) (<= ULTIMATE.start_main_~edgecount~4 .cse6) (<= 20 ULTIMATE.start_main_~edgecount~4) (<= .cse7 5) (or (< v_idx_202 .cse8) (<= 16 v_idx_202) (= 8 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Source~4 v_idx_202)))) (<= ULTIMATE.start_main_~nodecount~4 5) (or (<= 37 (+ v_idx_203 ULTIMATE.start_main_~edgecount~4)) (= 1 (+ (select ULTIMATE.start_main_~Source~4 v_idx_203) ULTIMATE.start_main_~i~4)) (< v_idx_203 16)) (or (= 0 (select ULTIMATE.start_main_~Source~4 v_idx_195)) (< v_idx_195 4) (<= 6 v_idx_195)) (or (= (select ULTIMATE.start_main_~Source~4 v_idx_193) 4) (< (+ ULTIMATE.start_main_~i~4 v_idx_193) 1) (<= 2 v_idx_193)) (or (< (+ v_idx_204 ULTIMATE.start_main_~edgecount~4) 37) (<= 24 (+ v_idx_204 ULTIMATE.start_main_~nodecount~4)) (= (select ULTIMATE.start_main_~Source~4 v_idx_204) 2)) (or (<= 13 (+ ULTIMATE.start_main_~i~4 v_idx_182)) (= 12 (select ULTIMATE.start_main_~Weight~4 v_idx_182)) (< v_idx_182 12)) (or (= 24 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_189) ULTIMATE.start_main_~nodecount~4)) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_189) 24) (<= 20 v_idx_189)) (or (<= 24 (+ ULTIMATE.start_main_~nodecount~4 v_idx_188)) (< v_idx_188 18) (= 18 (select ULTIMATE.start_main_~Weight~4 v_idx_188))) (<= .cse9 ULTIMATE.start_main_~nodecount~4) (or (<= 20 v_idx_205) (= (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Source~4 v_idx_205)) 8) (< (+ v_idx_205 ULTIMATE.start_main_~nodecount~4) 24)) (or (< v_idx_216 .cse10) (<= 13 (+ v_idx_216 ULTIMATE.start_main_~i~4)) (= 0 (select ULTIMATE.start_main_~Dest~4 v_idx_216))) (or (< (+ v_idx_201 ULTIMATE.start_main_~i~4) 13) (= (select ULTIMATE.start_main_~Source~4 v_idx_201) 0) (<= .cse8 v_idx_201)) (or (< (+ ULTIMATE.start_main_~i~4 v_idx_178) 8) (= 8 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_178) ULTIMATE.start_main_~i~4)) (<= .cse10 v_idx_178)) (or (< v_idx_184 .cse11) (= (select ULTIMATE.start_main_~Weight~4 v_idx_184) .cse11) (<= .cse8 v_idx_184)) (<= 5 ULTIMATE.start_main_~nodecount~4) (or (<= .cse11 v_idx_217) (= 2 (select ULTIMATE.start_main_~Dest~4 v_idx_217)) (< (+ v_idx_217 ULTIMATE.start_main_~i~4) 13)) (<= .cse12 25) (or (<= 2 v_idx_209) (= 8 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_209) ULTIMATE.start_main_~nodecount~4)) (< (+ ULTIMATE.start_main_~i~4 v_idx_209) 1)) (or (< v_idx_206 20) (= (select ULTIMATE.start_main_~Source~4 v_idx_206) v_v_67_1)) (or (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_211 15)) (= (+ ULTIMATE.start_main_~i~4 (select ULTIMATE.start_main_~Dest~4 v_idx_211)) 1) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_211) 8)) (or (= 0 (select ULTIMATE.start_main_~Dest~4 v_idx_219)) (<= 16 v_idx_219) (< v_idx_219 .cse8)) (or (<= .cse11 v_idx_183) (< (+ ULTIMATE.start_main_~i~4 v_idx_183) 13) (= 13 (+ ULTIMATE.start_main_~i~4 (select ULTIMATE.start_main_~Weight~4 v_idx_183)))) (or (= 2 (select ULTIMATE.start_main_~Weight~4 v_idx_172)) (<= 8 (+ ULTIMATE.start_main_~nodecount~4 v_idx_172)) (< v_idx_172 2)) (<= 5 .cse7) (or (<= 13 (+ ULTIMATE.start_main_~i~4 v_idx_200)) (= 8 (+ (select ULTIMATE.start_main_~Source~4 v_idx_200) ULTIMATE.start_main_~nodecount~4)) (< v_idx_200 12)) (or (<= 10 (+ v_idx_179 ULTIMATE.start_main_~i~4)) (< v_idx_179 .cse10) (= .cse10 (select ULTIMATE.start_main_~Weight~4 v_idx_179))) (or (<= 12 v_idx_181) (< (+ v_idx_181 ULTIMATE.start_main_~nodecount~4) 16) (= 16 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Weight~4 v_idx_181)))) (let ((.cse13 (+ ULTIMATE.start_main_~i~4 v_idx_198))) (or (= 4 (select ULTIMATE.start_main_~Source~4 v_idx_198)) (<= 10 .cse13) (< .cse13 8))) (or (= 2 (select ULTIMATE.start_main_~Source~4 v_idx_199)) (<= 12 v_idx_199) (< (+ ULTIMATE.start_main_~i~4 v_idx_199) 10)) (or (< v_idx_185 .cse8) (= .cse8 (select ULTIMATE.start_main_~Weight~4 v_idx_185)) (<= 16 v_idx_185)) (or (<= .cse8 v_idx_218) (= 8 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_218) ULTIMATE.start_main_~nodecount~4)) (< v_idx_218 .cse11)) (<= ULTIMATE.start_main_~edgecount~4 20) (or (< v_idx_190 20) (= v_v_187_1 (select ULTIMATE.start_main_~Weight~4 v_idx_190))) (or (< (+ v_idx_223 ULTIMATE.start_main_~nodecount~4) 24) (= (select ULTIMATE.start_main_~Dest~4 v_idx_223) 4) (<= 20 v_idx_223)) (<= ULTIMATE.start_main_~edgecount~4 .cse0) (or (= v_v_127_1 (select ULTIMATE.start_main_~Dest~4 v_idx_224)) (< v_idx_224 20)) (or (<= 2 v_idx_171) (< (+ ULTIMATE.start_main_~i~4 v_idx_171) 1) (= (+ ULTIMATE.start_main_~i~4 (select ULTIMATE.start_main_~Weight~4 v_idx_171)) 1)) (or (= v_v_8_1 (select ULTIMATE.start_main_~Source~4 v_idx_191)) (<= 0 v_idx_191)) (<= 40 .cse14) (let ((.cse15 (+ ULTIMATE.start_main_~i~4 v_idx_177))) (or (<= 8 .cse15) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_177) ULTIMATE.start_main_~i~4) 7) (< .cse15 7))) (<= .cse14 40) (or (<= 1 (+ v_idx_170 ULTIMATE.start_main_~i~4)) (< v_idx_170 0) (= 0 (select ULTIMATE.start_main_~Weight~4 v_idx_170))) (or (<= 4 v_idx_194) (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_194) ULTIMATE.start_main_~i~4) 1) (< v_idx_194 2)) (<= 20 .cse5) (or (= 37 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_187) ULTIMATE.start_main_~edgecount~4)) (< (+ ULTIMATE.start_main_~edgecount~4 v_idx_187) 37) (<= 18 v_idx_187)) (<= 25 .cse12) (<= 0 ULTIMATE.start_main_~i~4) (or (<= 8 (+ ULTIMATE.start_main_~nodecount~4 v_idx_210)) (= 4 (select ULTIMATE.start_main_~Dest~4 v_idx_210)) (< v_idx_210 2)) (or (= (+ ULTIMATE.start_main_~i~4 (select ULTIMATE.start_main_~Source~4 v_idx_196)) 1) (< v_idx_196 6) (<= 7 (+ ULTIMATE.start_main_~i~4 v_idx_196))) (or (<= 0 v_idx_169) (= v_v_128_1 (select ULTIMATE.start_main_~Weight~4 v_idx_169))) (<= 10 .cse4) (or (<= 37 (+ ULTIMATE.start_main_~edgecount~4 v_idx_186)) (< v_idx_186 16) (= 16 (select ULTIMATE.start_main_~Weight~4 v_idx_186))) (<= ULTIMATE.start_main_~i~4 0) (or (= (select ULTIMATE.start_main_~Dest~4 v_idx_222) 0) (< v_idx_222 18) (<= 24 (+ ULTIMATE.start_main_~nodecount~4 v_idx_222))) (or (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_208) ULTIMATE.start_main_~i~4) 1) (< v_idx_208 0) (<= 1 (+ v_idx_208 ULTIMATE.start_main_~i~4))) (<= .cse6 ULTIMATE.start_main_~edgecount~4) (or (<= 6 v_idx_175) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_175) 15) ULTIMATE.start_main_~edgecount~4) (< (+ v_idx_175 15) ULTIMATE.start_main_~edgecount~4)) (or (< (+ v_idx_215 ULTIMATE.start_main_~i~4) 8) (= 8 (+ ULTIMATE.start_main_~nodecount~4 (select ULTIMATE.start_main_~Dest~4 v_idx_215))) (<= .cse10 v_idx_215)) (or (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_174 15)) (= 4 (select ULTIMATE.start_main_~Weight~4 v_idx_174)) (< v_idx_174 4)) (<= ULTIMATE.start_main_~nodecount~4 .cse9)))))) [2019-01-08 14:32:48,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) no Hoare annotation was computed. [2019-01-08 14:32:48,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 176) no Hoare annotation was computed. [2019-01-08 14:32:48,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2019-01-08 14:32:48,724 INFO L444 ceAbstractionStarter]: At program point L144(lines 123 145) the Hoare annotation is: false [2019-01-08 14:32:48,725 INFO L444 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2019-01-08 14:32:48,727 INFO L444 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2019-01-08 14:32:48,780 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 02:32:48 BoogieIcfgContainer [2019-01-08 14:32:48,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-08 14:32:48,781 INFO L168 Benchmark]: Toolchain (without parser) took 853028.57 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -74.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-01-08 14:32:48,786 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:32:48,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:32:48,789 INFO L168 Benchmark]: Boogie Preprocessor took 31.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-08 14:32:48,790 INFO L168 Benchmark]: RCFGBuilder took 434.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-01-08 14:32:48,792 INFO L168 Benchmark]: TraceAbstraction took 852517.55 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -106.3 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-01-08 14:32:48,800 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 434.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 852517.55 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -106.3 MB). Peak memory consumption was 2.4 GB. 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_189 : int, v_idx_222 : 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_212 : int, v_idx_179 : 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_211 : int, v_idx_178 : 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_~i~4 + main_~Dest~4[v_idx_221] == 1 || 18 <= v_idx_221) || main_~edgecount~4 + v_idx_221 < 37)) && (main_~Dest~4[v_idx_207] == v_v_68_1 || 0 <= v_idx_207)) && ((8 <= main_~i~4 + v_idx_197 || main_~i~4 + v_idx_197 < 7) || 8 == main_~nodecount~4 + main_~Source~4[v_idx_197])) && 0 <= 2 * main_~i~4) && ((v_idx_214 + main_~i~4 < 7 || 8 <= v_idx_214 + main_~i~4) || 4 == main_~Dest~4[v_idx_214])) && ((1 <= v_idx_192 + main_~i~4 || v_idx_192 < 0) || 0 == main_~Source~4[v_idx_192])) && 2 * main_~i~4 <= 0) && 2 * main_~nodecount~4 <= 10) && ((main_~nodecount~4 + v_idx_173 < 8 || 8 == main_~nodecount~4 + main_~Weight~4[v_idx_173]) || 4 <= v_idx_173)) && ((main_~Weight~4[v_idx_180] + main_~i~4 == 10 || v_idx_180 + main_~i~4 < 10) || 16 <= v_idx_180 + main_~nodecount~4)) && main_~i~4 + main_~edgecount~4 <= 20) && ((main_~Dest~4[v_idx_220] == 2 || 37 <= main_~edgecount~4 + v_idx_220) || v_idx_220 < 16)) && ((8 == main_~nodecount~4 + main_~Dest~4[v_idx_213] || v_idx_213 < 6) || 7 <= v_idx_213 + main_~i~4)) && ((6 == main_~Weight~4[v_idx_176] || v_idx_176 < 6) || 7 <= main_~i~4 + v_idx_176)) && ((4 == main_~Dest~4[v_idx_212] || v_idx_212 + 15 < main_~edgecount~4) || 6 <= v_idx_212)) && main_~edgecount~4 <= main_~i~4 + 20) && 20 <= main_~edgecount~4) && main_~nodecount~4 + main_~i~4 <= 5) && ((v_idx_202 < main_~i~4 + 15 || 16 <= v_idx_202) || 8 == main_~nodecount~4 + main_~Source~4[v_idx_202])) && main_~nodecount~4 <= 5) && ((37 <= v_idx_203 + main_~edgecount~4 || 1 == main_~Source~4[v_idx_203] + main_~i~4) || v_idx_203 < 16)) && ((0 == main_~Source~4[v_idx_195] || v_idx_195 < 4) || 6 <= v_idx_195)) && ((main_~Source~4[v_idx_193] == 4 || main_~i~4 + v_idx_193 < 1) || 2 <= v_idx_193)) && ((v_idx_204 + main_~edgecount~4 < 37 || 24 <= v_idx_204 + main_~nodecount~4) || main_~Source~4[v_idx_204] == 2)) && ((13 <= main_~i~4 + v_idx_182 || 12 == main_~Weight~4[v_idx_182]) || v_idx_182 < 12)) && ((24 == main_~Weight~4[v_idx_189] + main_~nodecount~4 || main_~nodecount~4 + v_idx_189 < 24) || 20 <= v_idx_189)) && ((24 <= main_~nodecount~4 + v_idx_188 || v_idx_188 < 18) || 18 == main_~Weight~4[v_idx_188])) && main_~i~4 + 5 <= main_~nodecount~4) && ((20 <= v_idx_205 || main_~nodecount~4 + main_~Source~4[v_idx_205] == 8) || v_idx_205 + main_~nodecount~4 < 24)) && ((v_idx_216 < main_~i~4 + 9 || 13 <= v_idx_216 + main_~i~4) || 0 == main_~Dest~4[v_idx_216])) && ((v_idx_201 + main_~i~4 < 13 || main_~Source~4[v_idx_201] == 0) || main_~i~4 + 15 <= v_idx_201)) && ((main_~i~4 + v_idx_178 < 8 || 8 == main_~Weight~4[v_idx_178] + main_~i~4) || main_~i~4 + 9 <= v_idx_178)) && ((v_idx_184 < main_~i~4 + 14 || main_~Weight~4[v_idx_184] == main_~i~4 + 14) || main_~i~4 + 15 <= v_idx_184)) && 5 <= main_~nodecount~4) && ((main_~i~4 + 14 <= v_idx_217 || 2 == main_~Dest~4[v_idx_217]) || v_idx_217 + main_~i~4 < 13)) && main_~nodecount~4 + main_~edgecount~4 <= 25) && ((2 <= v_idx_209 || 8 == main_~Dest~4[v_idx_209] + main_~nodecount~4) || main_~i~4 + v_idx_209 < 1)) && (v_idx_206 < 20 || main_~Source~4[v_idx_206] == v_v_67_1)) && ((main_~edgecount~4 <= v_idx_211 + 15 || main_~i~4 + main_~Dest~4[v_idx_211] == 1) || main_~nodecount~4 + v_idx_211 < 8)) && ((0 == main_~Dest~4[v_idx_219] || 16 <= v_idx_219) || v_idx_219 < main_~i~4 + 15)) && ((main_~i~4 + 14 <= v_idx_183 || main_~i~4 + v_idx_183 < 13) || 13 == main_~i~4 + main_~Weight~4[v_idx_183])) && ((2 == main_~Weight~4[v_idx_172] || 8 <= main_~nodecount~4 + v_idx_172) || v_idx_172 < 2)) && 5 <= main_~nodecount~4 + main_~i~4) && ((13 <= main_~i~4 + v_idx_200 || 8 == main_~Source~4[v_idx_200] + main_~nodecount~4) || v_idx_200 < 12)) && ((10 <= v_idx_179 + main_~i~4 || v_idx_179 < main_~i~4 + 9) || main_~i~4 + 9 == main_~Weight~4[v_idx_179])) && ((12 <= v_idx_181 || v_idx_181 + main_~nodecount~4 < 16) || 16 == main_~nodecount~4 + main_~Weight~4[v_idx_181])) && ((4 == main_~Source~4[v_idx_198] || 10 <= main_~i~4 + v_idx_198) || main_~i~4 + v_idx_198 < 8)) && ((2 == main_~Source~4[v_idx_199] || 12 <= v_idx_199) || main_~i~4 + v_idx_199 < 10)) && ((v_idx_185 < main_~i~4 + 15 || main_~i~4 + 15 == main_~Weight~4[v_idx_185]) || 16 <= v_idx_185)) && ((main_~i~4 + 15 <= v_idx_218 || 8 == main_~Dest~4[v_idx_218] + main_~nodecount~4) || v_idx_218 < main_~i~4 + 14)) && main_~edgecount~4 <= 20) && (v_idx_190 < 20 || v_v_187_1 == main_~Weight~4[v_idx_190])) && ((v_idx_223 + main_~nodecount~4 < 24 || main_~Dest~4[v_idx_223] == 4) || 20 <= v_idx_223)) && main_~edgecount~4 <= main_~nodecount~4 + 15) && (v_v_127_1 == main_~Dest~4[v_idx_224] || v_idx_224 < 20)) && ((2 <= v_idx_171 || main_~i~4 + v_idx_171 < 1) || main_~i~4 + main_~Weight~4[v_idx_171] == 1)) && (v_v_8_1 == main_~Source~4[v_idx_191] || 0 <= v_idx_191)) && 40 <= 2 * main_~edgecount~4) && ((8 <= main_~i~4 + v_idx_177 || main_~Weight~4[v_idx_177] + main_~i~4 == 7) || main_~i~4 + v_idx_177 < 7)) && 2 * main_~edgecount~4 <= 40) && ((1 <= v_idx_170 + main_~i~4 || v_idx_170 < 0) || 0 == main_~Weight~4[v_idx_170])) && ((4 <= v_idx_194 || main_~Source~4[v_idx_194] + main_~i~4 == 1) || v_idx_194 < 2)) && 20 <= main_~i~4 + main_~edgecount~4) && ((37 == main_~Weight~4[v_idx_187] + main_~edgecount~4 || main_~edgecount~4 + v_idx_187 < 37) || 18 <= v_idx_187)) && 25 <= main_~nodecount~4 + main_~edgecount~4) && 0 <= main_~i~4) && ((8 <= main_~nodecount~4 + v_idx_210 || 4 == main_~Dest~4[v_idx_210]) || v_idx_210 < 2)) && ((main_~i~4 + main_~Source~4[v_idx_196] == 1 || v_idx_196 < 6) || 7 <= main_~i~4 + v_idx_196)) && (0 <= v_idx_169 || v_v_128_1 == main_~Weight~4[v_idx_169])) && 10 <= 2 * main_~nodecount~4) && ((37 <= main_~edgecount~4 + v_idx_186 || v_idx_186 < 16) || 16 == main_~Weight~4[v_idx_186])) && main_~i~4 <= 0) && ((main_~Dest~4[v_idx_222] == 0 || v_idx_222 < 18) || 24 <= main_~nodecount~4 + v_idx_222)) && ((main_~Dest~4[v_idx_208] + main_~i~4 == 1 || v_idx_208 < 0) || 1 <= v_idx_208 + main_~i~4)) && main_~i~4 + 20 <= main_~edgecount~4) && ((6 <= v_idx_175 || main_~Weight~4[v_idx_175] + 15 == main_~edgecount~4) || v_idx_175 + 15 < main_~edgecount~4)) && ((v_idx_215 + main_~i~4 < 8 || 8 == main_~nodecount~4 + main_~Dest~4[v_idx_215]) || main_~i~4 + 9 <= v_idx_215)) && ((main_~edgecount~4 <= v_idx_174 + 15 || 4 == main_~Weight~4[v_idx_174]) || v_idx_174 < 4)) && 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.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 548.4s AutomataDifference, 0.0s DeadEndRemovalTime, 34.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 1 SDs, 0 SdLazy, 13 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 545.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s 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, 259.7s 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, 958 HoareAnnotationTreeSize, 5 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 34.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s 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...