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-1de736e-m [2019-02-15 11:11:25,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:11:25,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:11:25,518 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:11:25,518 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:11:25,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:11:25,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:11:25,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:11:25,524 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:11:25,525 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:11:25,526 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:11:25,527 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:11:25,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:11:25,529 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:11:25,530 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:11:25,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:11:25,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:11:25,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:11:25,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:11:25,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:11:25,538 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:11:25,539 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:11:25,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:11:25,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:11:25,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:11:25,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:11:25,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:11:25,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:11:25,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:11:25,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:11:25,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:11:25,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:11:25,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:11:25,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:11:25,550 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:11:25,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:11:25,551 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:11:25,564 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:11:25,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:11:25,565 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:11:25,565 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:11:25,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:11:25,566 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:11:25,566 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:11:25,566 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:11:25,566 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:11:25,567 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:11:25,567 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:11:25,567 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:11:25,567 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:11:25,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:11:25,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:11:25,569 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:11:25,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:11:25,569 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:11:25,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:11:25,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:11:25,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:11:25,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:11:25,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:11:25,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:11:25,570 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:11:25,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:11:25,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:11:25,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:11:25,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:11:25,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:11:25,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:11:25,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:11:25,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:11:25,573 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:11:25,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:11:25,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:11:25,573 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:11:25,573 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:11:25,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:11:25,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:11:25,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:11:25,639 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:11:25,640 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:11:25,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl [2019-02-15 11:11:25,642 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_01.i_6.bpl' [2019-02-15 11:11:25,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:11:25,716 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:11:25,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:11:25,717 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:11:25,737 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,755 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:11:25,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:11:25,779 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,779 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,788 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,789 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,803 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,807 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,809 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:11:25,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:11:25,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:11:25,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:11:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:11:26,173 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:11:26,173 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-15 11:11:26,175 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:26 BoogieIcfgContainer [2019-02-15 11:11:26,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:11:26,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:11:26,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:11:26,179 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:11:26,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/2) ... [2019-02-15 11:11:26,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94ba8d6 and model type eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:11:26, skipping insertion in model container [2019-02-15 11:11:26,181 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 15.02 11:11:26" (2/2) ... [2019-02-15 11:11:26,183 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01.i_6.bpl [2019-02-15 11:11:26,192 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:11:26,201 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:11:26,218 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:11:26,251 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:11:26,251 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:11:26,251 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:11:26,252 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:11:26,252 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:11:26,252 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:11:26,252 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:11:26,252 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:11:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-15 11:11:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:11:26,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:11:26,279 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash 28790350, now seen corresponding path program 1 times [2019-02-15 11:11:26,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:26,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:11:26,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:11:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:11:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:26,713 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-02-15 11:11:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,887 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-02-15 11:11:26,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:11:26,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:11:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,900 INFO L225 Difference]: With dead ends: 15 [2019-02-15 11:11:26,900 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 11:11:26,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 11:11:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-02-15 11:11:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 11:11:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-15 11:11:26,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-02-15 11:11:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,939 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-02-15 11:11:26,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-02-15 11:11:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:11:26,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:11:26,941 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,941 INFO L82 PathProgramCache]: Analyzing trace with hash 892498710, now seen corresponding path program 1 times [2019-02-15 11:11:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:11:27,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:27,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:27,153 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:11:27,155 INFO L207 CegarAbsIntRunner]: [0], [5], [12], [20], [22], [30] [2019-02-15 11:11:27,215 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:27,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:17:02,863 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:17:02,865 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Never found a fixpoint. Largest state had 0 variables. [2019-02-15 11:17:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:02,869 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:17:05,092 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:17:08,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int) (v_idx_65 Int) (v_idx_66 Int) (v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int) (v_idx_104 Int) (v_idx_105 Int) (v_idx_102 Int) (v_idx_103 Int) (v_idx_108 Int) (v_idx_109 Int) (v_idx_106 Int) (v_idx_107 Int) (v_idx_100 Int) (v_idx_101 Int) (v_idx_58 Int) (v_idx_59 Int) (v_idx_98 Int) (v_idx_99 Int) (v_idx_96 Int) (v_idx_97 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int) (v_idx_89 Int) (v_idx_87 Int) (v_idx_88 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int) (v_idx_76 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int) (v_idx_111 Int) (v_idx_110 Int)) (let ((.cse2 (* 2 c_ULTIMATE.start_main_~i~4)) (.cse11 (+ c_ULTIMATE.start_main_~source~4 20)) (.cse5 (+ c_ULTIMATE.start_main_~edgecount~4 879)) (.cse20 (* 2 c_ULTIMATE.start_main_~edgecount~4)) (.cse6 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~source~4)) (.cse7 (+ c_ULTIMATE.start_main_~i~4 20)) (.cse18 (+ c_ULTIMATE.start_main_~nodecount~4 15)) (.cse19 (+ c_ULTIMATE.start_main_~edgecount~4 c_~INFINITY)) (.cse22 (+ c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse21 (+ c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4)) (.cse14 (+ c_ULTIMATE.start_main_~source~4 c_~INFINITY)) (.cse17 (+ c_ULTIMATE.start_main_~source~4 13)) (.cse3 (+ c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse15 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~i~4)) (.cse16 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~source~4)) (.cse9 (+ c_ULTIMATE.start_main_~source~4 899)) (.cse24 (+ c_ULTIMATE.start_main_~i~4 5)) (.cse10 (+ c_ULTIMATE.start_main_~source~4 5)) (.cse8 (+ c_ULTIMATE.start_main_~nodecount~4 894)) (.cse27 (+ c_ULTIMATE.start_main_~i~4 899)) (.cse12 (* 2 c_~INFINITY)) (.cse13 (* 2 c_ULTIMATE.start_main_~source~4)) (.cse1 (+ c_ULTIMATE.start_main_~i~4 3)) (.cse28 (+ c_ULTIMATE.start_main_~nodecount~4 c_ULTIMATE.start_main_~edgecount~4)) (.cse4 (+ c_ULTIMATE.start_main_~i~4 17)) (.cse26 (* 2 c_ULTIMATE.start_main_~nodecount~4)) (.cse30 (+ c_ULTIMATE.start_main_~i~4 c_~INFINITY)) (.cse25 (+ c_ULTIMATE.start_main_~nodecount~4 c_~INFINITY)) (.cse0 (+ c_ULTIMATE.start_main_~i~4 16))) (and (or (<= .cse0 v_idx_73) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_73) 15) (= (+ c_ULTIMATE.start_main_~i~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_73)) 15)) (or (< (+ v_idx_85 c_ULTIMATE.start_main_~edgecount~4) 27) (= .cse1 (select c_ULTIMATE.start_main_~Source~4 v_idx_85)) (<= 13 (+ v_idx_85 c_ULTIMATE.start_main_~nodecount~4))) (<= 0 .cse2) (or (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_67 10)) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_67) c_ULTIMATE.start_main_~source~4) 9) (< (+ v_idx_67 c_ULTIMATE.start_main_~source~4) 9)) (or (= (+ c_ULTIMATE.start_main_~edgecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_72)) 34) (< (+ v_idx_72 c_ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ c_ULTIMATE.start_main_~i~4 v_idx_72))) (<= .cse2 0) (or (< (+ c_ULTIMATE.start_main_~source~4 v_idx_60) 2) (<= .cse1 v_idx_60) (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_60)) 2)) (or (< (+ v_idx_59 4) c_ULTIMATE.start_main_~nodecount~4) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_59) 4) c_ULTIMATE.start_main_~nodecount~4) (<= 2 (+ v_idx_59 c_ULTIMATE.start_main_~source~4))) (<= .cse3 20) (or (= 13 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_66) c_ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_66 c_ULTIMATE.start_main_~nodecount~4) 13) (<= 9 (+ v_idx_66 c_ULTIMATE.start_main_~source~4))) (or (< v_idx_92 .cse4) (<= 19 (+ c_ULTIMATE.start_main_~source~4 v_idx_92)) (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Source~4 v_idx_92)) 2)) (<= c_~INFINITY .cse5) (<= 0 .cse6) (<= c_ULTIMATE.start_main_~edgecount~4 .cse7) (<= c_~INFINITY .cse8) (<= .cse9 c_~INFINITY) (<= .cse10 c_ULTIMATE.start_main_~nodecount~4) (or (= 6 (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_64))) (<= 27 (+ v_idx_64 c_ULTIMATE.start_main_~edgecount~4)) (< (+ v_idx_64 c_ULTIMATE.start_main_~source~4) 6)) (<= c_ULTIMATE.start_main_~i~4 c_ULTIMATE.start_main_~source~4) (<= c_ULTIMATE.start_main_~edgecount~4 .cse11) (<= .cse12 1798) (<= 0 .cse13) (<= .cse14 899) (<= .cse11 c_ULTIMATE.start_main_~edgecount~4) (<= .cse5 c_~INFINITY) (or (<= 17 (+ v_idx_87 c_ULTIMATE.start_main_~nodecount~4)) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_87) c_ULTIMATE.start_main_~source~4) 2) (< (+ v_idx_87 10) c_ULTIMATE.start_main_~edgecount~4)) (<= 5 .cse15) (or (<= .cse4 v_idx_91) (= (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_91) 4) c_ULTIMATE.start_main_~nodecount~4) (< v_idx_91 .cse0)) (or (< (+ v_idx_96 c_~INFINITY) 899) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_96 4)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_96) 4))) (<= .cse16 5) (or (< v_idx_71 .cse17) (<= 34 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_71)) (= .cse17 (select c_ULTIMATE.start_main_~Weight~4 v_idx_71))) (or (<= 6 (+ c_ULTIMATE.start_main_~source~4 v_idx_83)) (< (+ v_idx_83 895) c_~INFINITY) (= 899 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_83) c_~INFINITY))) (<= c_ULTIMATE.start_main_~edgecount~4 .cse18) (or (< (+ v_idx_88 c_ULTIMATE.start_main_~nodecount~4) 17) (<= .cse17 v_idx_88) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_88) .cse1)) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_103) .cse1) (< (+ v_idx_103 c_ULTIMATE.start_main_~nodecount~4) 13) (<= 9 (+ v_idx_103 c_ULTIMATE.start_main_~source~4))) (<= 919 .cse19) (or (<= .cse17 v_idx_70) (< (+ c_ULTIMATE.start_main_~nodecount~4 v_idx_70) 17) (= 17 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_70) c_ULTIMATE.start_main_~nodecount~4))) (or (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_77) (< (+ v_idx_77 c_ULTIMATE.start_main_~source~4) 19) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_77) c_ULTIMATE.start_main_~source~4) 19)) (<= 40 .cse20) (or (<= .cse17 v_idx_104) (< (+ v_idx_104 c_ULTIMATE.start_main_~source~4) 9) (= 899 (+ c_~INFINITY (select c_ULTIMATE.start_main_~Dest~4 v_idx_104)))) (<= 0 .cse21) (<= .cse20 40) (<= 20 .cse22) (or (= 899 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_89) c_~INFINITY)) (< v_idx_89 .cse17) (<= 15 (+ v_idx_89 c_ULTIMATE.start_main_~i~4))) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_102) 895) c_~INFINITY) (< (+ v_idx_102 c_ULTIMATE.start_main_~edgecount~4) 27) (<= 13 (+ v_idx_102 c_ULTIMATE.start_main_~nodecount~4))) (<= .cse6 0) (<= .cse7 c_ULTIMATE.start_main_~edgecount~4) (let ((.cse23 (+ c_ULTIMATE.start_main_~source~4 v_idx_110))) (or (= 899 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_110) c_~INFINITY)) (< .cse23 18) (<= 19 .cse23))) (<= c_ULTIMATE.start_main_~nodecount~4 .cse24) (<= .cse18 c_ULTIMATE.start_main_~edgecount~4) (<= .cse25 904) (or (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_81) 895)) (<= 2 (+ c_ULTIMATE.start_main_~source~4 v_idx_81)) (< (+ v_idx_81 4) c_ULTIMATE.start_main_~nodecount~4)) (<= .cse19 919) (or (< (+ v_idx_58 c_~INFINITY) 899) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_58 4)) (= 899 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_58) c_~INFINITY))) (or (< (+ c_ULTIMATE.start_main_~source~4 v_idx_82) 2) (<= c_~INFINITY (+ v_idx_82 895)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_82) 4))) (<= .cse26 10) (or (<= .cse0 v_idx_90) (< (+ c_ULTIMATE.start_main_~i~4 v_idx_90) 15) (= (select c_ULTIMATE.start_main_~Source~4 v_idx_90) .cse1)) (<= .cse22 20) (or (= (select c_ULTIMATE.start_main_~Dest~4 v_idx_101) .cse1) (< (+ c_ULTIMATE.start_main_~source~4 v_idx_101) 6) (<= 27 (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_101))) (<= .cse21 0) (or (< v_idx_74 .cse0) (= .cse0 (select c_ULTIMATE.start_main_~Weight~4 v_idx_74)) (<= .cse4 v_idx_74)) (<= 899 .cse14) (or (= (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_99) 4) c_ULTIMATE.start_main_~nodecount~4) (<= 25 (+ v_idx_99 c_ULTIMATE.start_main_~edgecount~4)) (< v_idx_99 .cse1)) (or (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_105)) 2) (<= 34 (+ v_idx_105 c_ULTIMATE.start_main_~edgecount~4)) (< v_idx_105 .cse17)) (<= 20 .cse3) (or (< (+ c_ULTIMATE.start_main_~source~4 v_idx_93) 19) (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_93) (= .cse1 (select c_ULTIMATE.start_main_~Source~4 v_idx_93))) (<= .cse15 5) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_68) 10) c_ULTIMATE.start_main_~edgecount~4) (<= c_~INFINITY (+ v_idx_68 888)) (< (+ v_idx_68 10) c_ULTIMATE.start_main_~edgecount~4)) (or (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_69) 888) c_~INFINITY) (< (+ v_idx_69 888) c_~INFINITY) (<= 17 (+ v_idx_69 c_ULTIMATE.start_main_~nodecount~4))) (or (<= .cse1 v_idx_98) (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_98) 895)) (< (+ v_idx_98 c_ULTIMATE.start_main_~source~4) 2)) (<= .cse27 c_~INFINITY) (<= 5 .cse16) (<= c_~INFINITY .cse9) (<= .cse24 c_ULTIMATE.start_main_~nodecount~4) (or (< (+ v_idx_80 c_~INFINITY) 899) (= 899 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_80) c_~INFINITY)) (<= c_ULTIMATE.start_main_~nodecount~4 (+ v_idx_80 4))) (<= c_ULTIMATE.start_main_~nodecount~4 .cse10) (or (<= 13 (+ v_idx_65 c_ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_65 c_ULTIMATE.start_main_~edgecount~4) 27) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_65) c_ULTIMATE.start_main_~edgecount~4) 27)) (<= .cse28 25) (or (<= 27 (+ v_idx_84 c_ULTIMATE.start_main_~edgecount~4)) (< (+ c_ULTIMATE.start_main_~source~4 v_idx_84) 6) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_84) 4))) (or (< (+ v_idx_86 c_ULTIMATE.start_main_~nodecount~4) 13) (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Source~4 v_idx_86) 895)) (<= c_ULTIMATE.start_main_~edgecount~4 (+ v_idx_86 10))) (or (= .cse4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_75)) (<= 18 (+ v_idx_75 c_ULTIMATE.start_main_~source~4)) (< v_idx_75 .cse4)) (or (<= 25 (+ v_idx_62 c_ULTIMATE.start_main_~edgecount~4)) (= (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_62) 895) c_~INFINITY) (< (+ v_idx_62 895) c_~INFINITY)) (or (<= c_~INFINITY (+ v_idx_61 895)) (< v_idx_61 .cse1) (= .cse1 (select c_ULTIMATE.start_main_~Weight~4 v_idx_61))) (or (< (+ v_idx_106 c_ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ v_idx_106 c_ULTIMATE.start_main_~i~4)) (= .cse1 (select c_ULTIMATE.start_main_~Dest~4 v_idx_106))) (<= .cse8 c_~INFINITY) (or (= 25 (+ c_ULTIMATE.start_main_~edgecount~4 (select c_ULTIMATE.start_main_~Weight~4 v_idx_63))) (<= 6 (+ v_idx_63 c_ULTIMATE.start_main_~source~4)) (< (+ v_idx_63 c_ULTIMATE.start_main_~edgecount~4) 25)) (let ((.cse29 (+ v_idx_76 c_ULTIMATE.start_main_~source~4))) (or (= 18 (+ (select c_ULTIMATE.start_main_~Weight~4 v_idx_76) c_ULTIMATE.start_main_~source~4)) (<= 19 .cse29) (< .cse29 18))) (<= c_~INFINITY .cse27) (<= 899 .cse30) (<= 1798 .cse12) (<= c_ULTIMATE.start_main_~source~4 c_ULTIMATE.start_main_~i~4) (<= .cse13 0) (or (<= c_ULTIMATE.start_main_~edgecount~4 v_idx_111) (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_111) 895)) (< (+ c_ULTIMATE.start_main_~source~4 v_idx_111) 19)) (or (= .cse1 (select c_ULTIMATE.start_main_~Dest~4 v_idx_97)) (< (+ v_idx_97 4) c_ULTIMATE.start_main_~nodecount~4) (<= 2 (+ v_idx_97 c_ULTIMATE.start_main_~source~4))) (<= 25 .cse28) (or (<= .cse4 v_idx_108) (< v_idx_108 .cse0) (= (+ c_ULTIMATE.start_main_~source~4 (select c_ULTIMATE.start_main_~Dest~4 v_idx_108)) 2)) (or (< v_idx_109 .cse4) (<= 18 (+ v_idx_109 c_ULTIMATE.start_main_~source~4)) (= c_ULTIMATE.start_main_~nodecount~4 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_109) 4))) (<= 10 .cse26) (<= .cse30 899) (<= 904 .cse25) (or (<= .cse0 v_idx_107) (= 899 (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_107) c_~INFINITY)) (< (+ v_idx_107 c_ULTIMATE.start_main_~i~4) 15)) (or (= c_~INFINITY (+ (select c_ULTIMATE.start_main_~Dest~4 v_idx_100) 895)) (< (+ c_ULTIMATE.start_main_~edgecount~4 v_idx_100) 25) (<= 6 (+ c_ULTIMATE.start_main_~source~4 v_idx_100)))))) is different from false [2019-02-15 11:17:08,899 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-15 11:17:08,899 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:17:08,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:17:08,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-02-15 11:17:08,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:17:08,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:17:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:17:08,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2019-02-15 11:17:08,906 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-02-15 11:17:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:09,396 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2019-02-15 11:17:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:17:09,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-02-15 11:17:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:09,397 INFO L225 Difference]: With dead ends: 9 [2019-02-15 11:17:09,397 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 11:17:09,398 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-02-15 11:17:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 11:17:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 11:17:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 11:17:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 11:17:09,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-15 11:17:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:09,400 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 11:17:09,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:17:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 11:17:09,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 11:17:09,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 11:17:17,927 WARN L181 SmtUtils]: Spent 8.48 s on a formula simplification. DAG size of input: 531 DAG size of output: 529 [2019-02-15 11:17:17,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 176) no Hoare annotation was computed. [2019-02-15 11:17:17,982 INFO L444 ceAbstractionStarter]: At program point L155(lines 155 174) the Hoare annotation is: false [2019-02-15 11:17:17,983 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 175) no Hoare annotation was computed. [2019-02-15 11:17:17,985 INFO L444 ceAbstractionStarter]: At program point L114(lines 97 114) the Hoare annotation is: (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int) (v_idx_65 Int) (v_idx_66 Int) (v_idx_63 Int) (v_idx_64 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int) (v_idx_104 Int) (v_idx_105 Int) (v_idx_102 Int) (v_idx_103 Int) (v_idx_108 Int) (v_idx_109 Int) (v_idx_106 Int) (v_idx_107 Int) (v_idx_100 Int) (v_idx_101 Int) (v_idx_58 Int) (v_idx_59 Int) (v_idx_98 Int) (v_idx_99 Int) (v_idx_96 Int) (v_idx_97 Int) (v_idx_92 Int) (v_idx_93 Int) (v_idx_90 Int) (v_idx_91 Int) (v_idx_89 Int) (v_idx_87 Int) (v_idx_88 Int) (v_idx_85 Int) (v_idx_86 Int) (v_idx_83 Int) (v_idx_84 Int) (v_idx_81 Int) (v_idx_82 Int) (v_idx_80 Int) (v_idx_76 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int) (v_idx_111 Int) (v_idx_110 Int)) (let ((.cse2 (* 2 ULTIMATE.start_main_~i~4)) (.cse11 (+ ULTIMATE.start_main_~source~4 20)) (.cse5 (+ ULTIMATE.start_main_~edgecount~4 879)) (.cse20 (* 2 ULTIMATE.start_main_~edgecount~4)) (.cse6 (+ ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~source~4)) (.cse7 (+ ULTIMATE.start_main_~i~4 20)) (.cse18 (+ ULTIMATE.start_main_~nodecount~4 15)) (.cse19 (+ ULTIMATE.start_main_~edgecount~4 ~INFINITY)) (.cse22 (+ ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~edgecount~4)) (.cse21 (+ ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4)) (.cse14 (+ ULTIMATE.start_main_~source~4 ~INFINITY)) (.cse17 (+ ULTIMATE.start_main_~source~4 13)) (.cse3 (+ ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~edgecount~4)) (.cse15 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~i~4)) (.cse16 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~source~4)) (.cse9 (+ ULTIMATE.start_main_~source~4 899)) (.cse24 (+ ULTIMATE.start_main_~i~4 5)) (.cse10 (+ ULTIMATE.start_main_~source~4 5)) (.cse8 (+ ULTIMATE.start_main_~nodecount~4 894)) (.cse27 (+ ULTIMATE.start_main_~i~4 899)) (.cse12 (* 2 ~INFINITY)) (.cse13 (* 2 ULTIMATE.start_main_~source~4)) (.cse1 (+ ULTIMATE.start_main_~i~4 3)) (.cse28 (+ ULTIMATE.start_main_~nodecount~4 ULTIMATE.start_main_~edgecount~4)) (.cse4 (+ ULTIMATE.start_main_~i~4 17)) (.cse26 (* 2 ULTIMATE.start_main_~nodecount~4)) (.cse30 (+ ULTIMATE.start_main_~i~4 ~INFINITY)) (.cse25 (+ ULTIMATE.start_main_~nodecount~4 ~INFINITY)) (.cse0 (+ ULTIMATE.start_main_~i~4 16))) (and (or (<= .cse0 v_idx_73) (< (+ ULTIMATE.start_main_~i~4 v_idx_73) 15) (= (+ ULTIMATE.start_main_~i~4 (select ULTIMATE.start_main_~Weight~4 v_idx_73)) 15)) (or (< (+ v_idx_85 ULTIMATE.start_main_~edgecount~4) 27) (= .cse1 (select ULTIMATE.start_main_~Source~4 v_idx_85)) (<= 13 (+ v_idx_85 ULTIMATE.start_main_~nodecount~4))) (<= 0 .cse2) (or (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_67 10)) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_67) ULTIMATE.start_main_~source~4) 9) (< (+ v_idx_67 ULTIMATE.start_main_~source~4) 9)) (or (= (+ ULTIMATE.start_main_~edgecount~4 (select ULTIMATE.start_main_~Weight~4 v_idx_72)) 34) (< (+ v_idx_72 ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ ULTIMATE.start_main_~i~4 v_idx_72))) (<= .cse2 0) (or (< (+ ULTIMATE.start_main_~source~4 v_idx_60) 2) (<= .cse1 v_idx_60) (= (+ ULTIMATE.start_main_~source~4 (select ULTIMATE.start_main_~Weight~4 v_idx_60)) 2)) (or (< (+ v_idx_59 4) ULTIMATE.start_main_~nodecount~4) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_59) 4) ULTIMATE.start_main_~nodecount~4) (<= 2 (+ v_idx_59 ULTIMATE.start_main_~source~4))) (<= .cse3 20) (or (= 13 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_66) ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_66 ULTIMATE.start_main_~nodecount~4) 13) (<= 9 (+ v_idx_66 ULTIMATE.start_main_~source~4))) (or (< v_idx_92 .cse4) (<= 19 (+ ULTIMATE.start_main_~source~4 v_idx_92)) (= (+ ULTIMATE.start_main_~source~4 (select ULTIMATE.start_main_~Source~4 v_idx_92)) 2)) (<= ~INFINITY .cse5) (<= 0 .cse6) (<= ULTIMATE.start_main_~edgecount~4 .cse7) (<= ~INFINITY .cse8) (<= .cse9 ~INFINITY) (<= .cse10 ULTIMATE.start_main_~nodecount~4) (or (= 6 (+ ULTIMATE.start_main_~source~4 (select ULTIMATE.start_main_~Weight~4 v_idx_64))) (<= 27 (+ v_idx_64 ULTIMATE.start_main_~edgecount~4)) (< (+ v_idx_64 ULTIMATE.start_main_~source~4) 6)) (<= ULTIMATE.start_main_~i~4 ULTIMATE.start_main_~source~4) (<= ULTIMATE.start_main_~edgecount~4 .cse11) (<= .cse12 1798) (<= 0 .cse13) (<= .cse14 899) (<= .cse11 ULTIMATE.start_main_~edgecount~4) (<= .cse5 ~INFINITY) (or (<= 17 (+ v_idx_87 ULTIMATE.start_main_~nodecount~4)) (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_87) ULTIMATE.start_main_~source~4) 2) (< (+ v_idx_87 10) ULTIMATE.start_main_~edgecount~4)) (<= 5 .cse15) (or (<= .cse4 v_idx_91) (= (+ (select ULTIMATE.start_main_~Source~4 v_idx_91) 4) ULTIMATE.start_main_~nodecount~4) (< v_idx_91 .cse0)) (or (< (+ v_idx_96 ~INFINITY) 899) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_96 4)) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_96) 4))) (<= .cse16 5) (or (< v_idx_71 .cse17) (<= 34 (+ ULTIMATE.start_main_~edgecount~4 v_idx_71)) (= .cse17 (select ULTIMATE.start_main_~Weight~4 v_idx_71))) (or (<= 6 (+ ULTIMATE.start_main_~source~4 v_idx_83)) (< (+ v_idx_83 895) ~INFINITY) (= 899 (+ (select ULTIMATE.start_main_~Source~4 v_idx_83) ~INFINITY))) (<= ULTIMATE.start_main_~edgecount~4 .cse18) (or (< (+ v_idx_88 ULTIMATE.start_main_~nodecount~4) 17) (<= .cse17 v_idx_88) (= (select ULTIMATE.start_main_~Source~4 v_idx_88) .cse1)) (or (= (select ULTIMATE.start_main_~Dest~4 v_idx_103) .cse1) (< (+ v_idx_103 ULTIMATE.start_main_~nodecount~4) 13) (<= 9 (+ v_idx_103 ULTIMATE.start_main_~source~4))) (<= 919 .cse19) (or (<= .cse17 v_idx_70) (< (+ ULTIMATE.start_main_~nodecount~4 v_idx_70) 17) (= 17 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_70) ULTIMATE.start_main_~nodecount~4))) (or (<= ULTIMATE.start_main_~edgecount~4 v_idx_77) (< (+ v_idx_77 ULTIMATE.start_main_~source~4) 19) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_77) ULTIMATE.start_main_~source~4) 19)) (<= 40 .cse20) (or (<= .cse17 v_idx_104) (< (+ v_idx_104 ULTIMATE.start_main_~source~4) 9) (= 899 (+ ~INFINITY (select ULTIMATE.start_main_~Dest~4 v_idx_104)))) (<= 0 .cse21) (<= .cse20 40) (<= 20 .cse22) (or (= 899 (+ (select ULTIMATE.start_main_~Source~4 v_idx_89) ~INFINITY)) (< v_idx_89 .cse17) (<= 15 (+ v_idx_89 ULTIMATE.start_main_~i~4))) (or (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_102) 895) ~INFINITY) (< (+ v_idx_102 ULTIMATE.start_main_~edgecount~4) 27) (<= 13 (+ v_idx_102 ULTIMATE.start_main_~nodecount~4))) (<= .cse6 0) (<= .cse7 ULTIMATE.start_main_~edgecount~4) (let ((.cse23 (+ ULTIMATE.start_main_~source~4 v_idx_110))) (or (= 899 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_110) ~INFINITY)) (< .cse23 18) (<= 19 .cse23))) (<= ULTIMATE.start_main_~nodecount~4 .cse24) (<= .cse18 ULTIMATE.start_main_~edgecount~4) (<= .cse25 904) (or (= ~INFINITY (+ (select ULTIMATE.start_main_~Source~4 v_idx_81) 895)) (<= 2 (+ ULTIMATE.start_main_~source~4 v_idx_81)) (< (+ v_idx_81 4) ULTIMATE.start_main_~nodecount~4)) (<= .cse19 919) (or (< (+ v_idx_58 ~INFINITY) 899) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_58 4)) (= 899 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_58) ~INFINITY))) (or (< (+ ULTIMATE.start_main_~source~4 v_idx_82) 2) (<= ~INFINITY (+ v_idx_82 895)) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Source~4 v_idx_82) 4))) (<= .cse26 10) (or (<= .cse0 v_idx_90) (< (+ ULTIMATE.start_main_~i~4 v_idx_90) 15) (= (select ULTIMATE.start_main_~Source~4 v_idx_90) .cse1)) (<= .cse22 20) (or (= (select ULTIMATE.start_main_~Dest~4 v_idx_101) .cse1) (< (+ ULTIMATE.start_main_~source~4 v_idx_101) 6) (<= 27 (+ ULTIMATE.start_main_~edgecount~4 v_idx_101))) (<= .cse21 0) (or (< v_idx_74 .cse0) (= .cse0 (select ULTIMATE.start_main_~Weight~4 v_idx_74)) (<= .cse4 v_idx_74)) (<= 899 .cse14) (or (= (+ (select ULTIMATE.start_main_~Dest~4 v_idx_99) 4) ULTIMATE.start_main_~nodecount~4) (<= 25 (+ v_idx_99 ULTIMATE.start_main_~edgecount~4)) (< v_idx_99 .cse1)) (or (= (+ ULTIMATE.start_main_~source~4 (select ULTIMATE.start_main_~Dest~4 v_idx_105)) 2) (<= 34 (+ v_idx_105 ULTIMATE.start_main_~edgecount~4)) (< v_idx_105 .cse17)) (<= 20 .cse3) (or (< (+ ULTIMATE.start_main_~source~4 v_idx_93) 19) (<= ULTIMATE.start_main_~edgecount~4 v_idx_93) (= .cse1 (select ULTIMATE.start_main_~Source~4 v_idx_93))) (<= .cse15 5) (or (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_68) 10) ULTIMATE.start_main_~edgecount~4) (<= ~INFINITY (+ v_idx_68 888)) (< (+ v_idx_68 10) ULTIMATE.start_main_~edgecount~4)) (or (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_69) 888) ~INFINITY) (< (+ v_idx_69 888) ~INFINITY) (<= 17 (+ v_idx_69 ULTIMATE.start_main_~nodecount~4))) (or (<= .cse1 v_idx_98) (= ~INFINITY (+ (select ULTIMATE.start_main_~Dest~4 v_idx_98) 895)) (< (+ v_idx_98 ULTIMATE.start_main_~source~4) 2)) (<= .cse27 ~INFINITY) (<= 5 .cse16) (<= ~INFINITY .cse9) (<= .cse24 ULTIMATE.start_main_~nodecount~4) (or (< (+ v_idx_80 ~INFINITY) 899) (= 899 (+ (select ULTIMATE.start_main_~Source~4 v_idx_80) ~INFINITY)) (<= ULTIMATE.start_main_~nodecount~4 (+ v_idx_80 4))) (<= ULTIMATE.start_main_~nodecount~4 .cse10) (or (<= 13 (+ v_idx_65 ULTIMATE.start_main_~nodecount~4)) (< (+ v_idx_65 ULTIMATE.start_main_~edgecount~4) 27) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_65) ULTIMATE.start_main_~edgecount~4) 27)) (<= .cse28 25) (or (<= 27 (+ v_idx_84 ULTIMATE.start_main_~edgecount~4)) (< (+ ULTIMATE.start_main_~source~4 v_idx_84) 6) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Source~4 v_idx_84) 4))) (or (< (+ v_idx_86 ULTIMATE.start_main_~nodecount~4) 13) (= ~INFINITY (+ (select ULTIMATE.start_main_~Source~4 v_idx_86) 895)) (<= ULTIMATE.start_main_~edgecount~4 (+ v_idx_86 10))) (or (= .cse4 (select ULTIMATE.start_main_~Weight~4 v_idx_75)) (<= 18 (+ v_idx_75 ULTIMATE.start_main_~source~4)) (< v_idx_75 .cse4)) (or (<= 25 (+ v_idx_62 ULTIMATE.start_main_~edgecount~4)) (= (+ (select ULTIMATE.start_main_~Weight~4 v_idx_62) 895) ~INFINITY) (< (+ v_idx_62 895) ~INFINITY)) (or (<= ~INFINITY (+ v_idx_61 895)) (< v_idx_61 .cse1) (= .cse1 (select ULTIMATE.start_main_~Weight~4 v_idx_61))) (or (< (+ v_idx_106 ULTIMATE.start_main_~edgecount~4) 34) (<= 15 (+ v_idx_106 ULTIMATE.start_main_~i~4)) (= .cse1 (select ULTIMATE.start_main_~Dest~4 v_idx_106))) (<= .cse8 ~INFINITY) (or (= 25 (+ ULTIMATE.start_main_~edgecount~4 (select ULTIMATE.start_main_~Weight~4 v_idx_63))) (<= 6 (+ v_idx_63 ULTIMATE.start_main_~source~4)) (< (+ v_idx_63 ULTIMATE.start_main_~edgecount~4) 25)) (let ((.cse29 (+ v_idx_76 ULTIMATE.start_main_~source~4))) (or (= 18 (+ (select ULTIMATE.start_main_~Weight~4 v_idx_76) ULTIMATE.start_main_~source~4)) (<= 19 .cse29) (< .cse29 18))) (<= ~INFINITY .cse27) (<= 899 .cse30) (<= 1798 .cse12) (<= ULTIMATE.start_main_~source~4 ULTIMATE.start_main_~i~4) (<= .cse13 0) (or (<= ULTIMATE.start_main_~edgecount~4 v_idx_111) (= ~INFINITY (+ (select ULTIMATE.start_main_~Dest~4 v_idx_111) 895)) (< (+ ULTIMATE.start_main_~source~4 v_idx_111) 19)) (or (= .cse1 (select ULTIMATE.start_main_~Dest~4 v_idx_97)) (< (+ v_idx_97 4) ULTIMATE.start_main_~nodecount~4) (<= 2 (+ v_idx_97 ULTIMATE.start_main_~source~4))) (<= 25 .cse28) (or (<= .cse4 v_idx_108) (< v_idx_108 .cse0) (= (+ ULTIMATE.start_main_~source~4 (select ULTIMATE.start_main_~Dest~4 v_idx_108)) 2)) (or (< v_idx_109 .cse4) (<= 18 (+ v_idx_109 ULTIMATE.start_main_~source~4)) (= ULTIMATE.start_main_~nodecount~4 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_109) 4))) (<= 10 .cse26) (<= .cse30 899) (<= 904 .cse25) (or (<= .cse0 v_idx_107) (= 899 (+ (select ULTIMATE.start_main_~Dest~4 v_idx_107) ~INFINITY)) (< (+ v_idx_107 ULTIMATE.start_main_~i~4) 15)) (or (= ~INFINITY (+ (select ULTIMATE.start_main_~Dest~4 v_idx_100) 895)) (< (+ ULTIMATE.start_main_~edgecount~4 v_idx_100) 25) (<= 6 (+ ULTIMATE.start_main_~source~4 v_idx_100)))))) [2019-02-15 11:17:17,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 176) no Hoare annotation was computed. [2019-02-15 11:17:17,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 176) no Hoare annotation was computed. [2019-02-15 11:17:17,993 INFO L444 ceAbstractionStarter]: At program point L144(lines 123 145) the Hoare annotation is: false [2019-02-15 11:17:17,993 INFO L444 ceAbstractionStarter]: At program point L173(lines 127 173) the Hoare annotation is: false [2019-02-15 11:17:17,994 INFO L444 ceAbstractionStarter]: At program point L163(lines 106 163) the Hoare annotation is: false [2019-02-15 11:17:18,062 INFO L202 PluginConnector]: Adding new model eureka_01.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:17:18 BoogieIcfgContainer [2019-02-15 11:17:18,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 11:17:18,063 INFO L168 Benchmark]: Toolchain (without parser) took 352348.24 ms. Allocated memory was 130.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 103.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 886.0 MB. Max. memory is 7.1 GB. [2019-02-15 11:17:18,065 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 130.0 MB. Free memory is still 105.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:17:18,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.26 ms. Allocated memory is still 130.0 MB. Free memory was 103.5 MB in the beginning and 101.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-15 11:17:18,070 INFO L168 Benchmark]: Boogie Preprocessor took 45.22 ms. Allocated memory is still 130.0 MB. Free memory was 101.9 MB in the beginning and 100.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-02-15 11:17:18,071 INFO L168 Benchmark]: RCFGBuilder took 355.95 ms. Allocated memory is still 130.0 MB. Free memory was 100.4 MB in the beginning and 87.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-02-15 11:17:18,072 INFO L168 Benchmark]: TraceAbstraction took 351886.58 ms. Allocated memory was 130.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 87.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 869.7 MB. Max. memory is 7.1 GB. [2019-02-15 11:17:18,083 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.28 ms. Allocated memory is still 130.0 MB. Free memory is still 105.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.26 ms. Allocated memory is still 130.0 MB. Free memory was 103.5 MB in the beginning and 101.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.22 ms. Allocated memory is still 130.0 MB. Free memory was 101.9 MB in the beginning and 100.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 355.95 ms. Allocated memory is still 130.0 MB. Free memory was 100.4 MB in the beginning and 87.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 351886.58 ms. Allocated memory was 130.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 87.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 869.7 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: (forall v_idx_69 : int, v_idx_67 : int, v_idx_68 : int, v_idx_65 : int, v_idx_66 : int, v_idx_63 : int, v_idx_64 : int, v_idx_61 : int, v_idx_62 : int, v_idx_60 : int, v_idx_104 : int, v_idx_105 : int, v_idx_102 : int, v_idx_103 : int, v_idx_108 : int, v_idx_109 : int, v_idx_106 : int, v_idx_107 : int, v_idx_100 : int, v_idx_101 : int, v_idx_58 : int, v_idx_59 : int, v_idx_98 : int, v_idx_99 : int, v_idx_96 : int, v_idx_97 : int, v_idx_92 : int, v_idx_93 : int, v_idx_90 : int, v_idx_91 : int, v_idx_89 : int, v_idx_87 : int, v_idx_88 : int, v_idx_85 : int, v_idx_86 : int, v_idx_83 : int, v_idx_84 : int, v_idx_81 : int, v_idx_82 : int, v_idx_80 : int, v_idx_76 : int, v_idx_77 : int, v_idx_74 : int, v_idx_75 : int, v_idx_72 : int, v_idx_73 : int, v_idx_70 : int, v_idx_71 : int, v_idx_111 : int, v_idx_110 : int :: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~4 + 16 <= v_idx_73 || main_~i~4 + v_idx_73 < 15) || main_~i~4 + main_~Weight~4[v_idx_73] == 15) && ((v_idx_85 + main_~edgecount~4 < 27 || main_~i~4 + 3 == main_~Source~4[v_idx_85]) || 13 <= v_idx_85 + main_~nodecount~4)) && 0 <= 2 * main_~i~4) && ((main_~edgecount~4 <= v_idx_67 + 10 || main_~Weight~4[v_idx_67] + main_~source~4 == 9) || v_idx_67 + main_~source~4 < 9)) && ((main_~edgecount~4 + main_~Weight~4[v_idx_72] == 34 || v_idx_72 + main_~edgecount~4 < 34) || 15 <= main_~i~4 + v_idx_72)) && 2 * main_~i~4 <= 0) && ((main_~source~4 + v_idx_60 < 2 || main_~i~4 + 3 <= v_idx_60) || main_~source~4 + main_~Weight~4[v_idx_60] == 2)) && ((v_idx_59 + 4 < main_~nodecount~4 || main_~Weight~4[v_idx_59] + 4 == main_~nodecount~4) || 2 <= v_idx_59 + main_~source~4)) && main_~source~4 + main_~edgecount~4 <= 20) && ((13 == main_~Weight~4[v_idx_66] + main_~nodecount~4 || v_idx_66 + main_~nodecount~4 < 13) || 9 <= v_idx_66 + main_~source~4)) && ((v_idx_92 < main_~i~4 + 17 || 19 <= main_~source~4 + v_idx_92) || main_~source~4 + main_~Source~4[v_idx_92] == 2)) && ~INFINITY <= main_~edgecount~4 + 879) && 0 <= main_~i~4 + main_~source~4) && main_~edgecount~4 <= main_~i~4 + 20) && ~INFINITY <= main_~nodecount~4 + 894) && main_~source~4 + 899 <= ~INFINITY) && main_~source~4 + 5 <= main_~nodecount~4) && ((6 == main_~source~4 + main_~Weight~4[v_idx_64] || 27 <= v_idx_64 + main_~edgecount~4) || v_idx_64 + main_~source~4 < 6)) && main_~i~4 <= main_~source~4) && main_~edgecount~4 <= main_~source~4 + 20) && 2 * ~INFINITY <= 1798) && 0 <= 2 * main_~source~4) && main_~source~4 + ~INFINITY <= 899) && main_~source~4 + 20 <= main_~edgecount~4) && main_~edgecount~4 + 879 <= ~INFINITY) && ((17 <= v_idx_87 + main_~nodecount~4 || main_~Source~4[v_idx_87] + main_~source~4 == 2) || v_idx_87 + 10 < main_~edgecount~4)) && 5 <= main_~nodecount~4 + main_~i~4) && ((main_~i~4 + 17 <= v_idx_91 || main_~Source~4[v_idx_91] + 4 == main_~nodecount~4) || v_idx_91 < main_~i~4 + 16)) && ((v_idx_96 + ~INFINITY < 899 || main_~nodecount~4 <= v_idx_96 + 4) || main_~nodecount~4 == main_~Dest~4[v_idx_96] + 4)) && main_~nodecount~4 + main_~source~4 <= 5) && ((v_idx_71 < main_~source~4 + 13 || 34 <= main_~edgecount~4 + v_idx_71) || main_~source~4 + 13 == main_~Weight~4[v_idx_71])) && ((6 <= main_~source~4 + v_idx_83 || v_idx_83 + 895 < ~INFINITY) || 899 == main_~Source~4[v_idx_83] + ~INFINITY)) && main_~edgecount~4 <= main_~nodecount~4 + 15) && ((v_idx_88 + main_~nodecount~4 < 17 || main_~source~4 + 13 <= v_idx_88) || main_~Source~4[v_idx_88] == main_~i~4 + 3)) && ((main_~Dest~4[v_idx_103] == main_~i~4 + 3 || v_idx_103 + main_~nodecount~4 < 13) || 9 <= v_idx_103 + main_~source~4)) && 919 <= main_~edgecount~4 + ~INFINITY) && ((main_~source~4 + 13 <= v_idx_70 || main_~nodecount~4 + v_idx_70 < 17) || 17 == main_~Weight~4[v_idx_70] + main_~nodecount~4)) && ((main_~edgecount~4 <= v_idx_77 || v_idx_77 + main_~source~4 < 19) || main_~Weight~4[v_idx_77] + main_~source~4 == 19)) && 40 <= 2 * main_~edgecount~4) && ((main_~source~4 + 13 <= v_idx_104 || v_idx_104 + main_~source~4 < 9) || 899 == ~INFINITY + main_~Dest~4[v_idx_104])) && 0 <= main_~source~4 + main_~i~4) && 2 * main_~edgecount~4 <= 40) && 20 <= main_~i~4 + main_~edgecount~4) && ((899 == main_~Source~4[v_idx_89] + ~INFINITY || v_idx_89 < main_~source~4 + 13) || 15 <= v_idx_89 + main_~i~4)) && ((main_~Dest~4[v_idx_102] + 895 == ~INFINITY || v_idx_102 + main_~edgecount~4 < 27) || 13 <= v_idx_102 + main_~nodecount~4)) && main_~i~4 + main_~source~4 <= 0) && main_~i~4 + 20 <= main_~edgecount~4) && ((899 == main_~Dest~4[v_idx_110] + ~INFINITY || main_~source~4 + v_idx_110 < 18) || 19 <= main_~source~4 + v_idx_110)) && main_~nodecount~4 <= main_~i~4 + 5) && main_~nodecount~4 + 15 <= main_~edgecount~4) && main_~nodecount~4 + ~INFINITY <= 904) && ((~INFINITY == main_~Source~4[v_idx_81] + 895 || 2 <= main_~source~4 + v_idx_81) || v_idx_81 + 4 < main_~nodecount~4)) && main_~edgecount~4 + ~INFINITY <= 919) && ((v_idx_58 + ~INFINITY < 899 || main_~nodecount~4 <= v_idx_58 + 4) || 899 == main_~Weight~4[v_idx_58] + ~INFINITY)) && ((main_~source~4 + v_idx_82 < 2 || ~INFINITY <= v_idx_82 + 895) || main_~nodecount~4 == main_~Source~4[v_idx_82] + 4)) && 2 * main_~nodecount~4 <= 10) && ((main_~i~4 + 16 <= v_idx_90 || main_~i~4 + v_idx_90 < 15) || main_~Source~4[v_idx_90] == main_~i~4 + 3)) && main_~i~4 + main_~edgecount~4 <= 20) && ((main_~Dest~4[v_idx_101] == main_~i~4 + 3 || main_~source~4 + v_idx_101 < 6) || 27 <= main_~edgecount~4 + v_idx_101)) && main_~source~4 + main_~i~4 <= 0) && ((v_idx_74 < main_~i~4 + 16 || main_~i~4 + 16 == main_~Weight~4[v_idx_74]) || main_~i~4 + 17 <= v_idx_74)) && 899 <= main_~source~4 + ~INFINITY) && ((main_~Dest~4[v_idx_99] + 4 == main_~nodecount~4 || 25 <= v_idx_99 + main_~edgecount~4) || v_idx_99 < main_~i~4 + 3)) && ((main_~source~4 + main_~Dest~4[v_idx_105] == 2 || 34 <= v_idx_105 + main_~edgecount~4) || v_idx_105 < main_~source~4 + 13)) && 20 <= main_~source~4 + main_~edgecount~4) && ((main_~source~4 + v_idx_93 < 19 || main_~edgecount~4 <= v_idx_93) || main_~i~4 + 3 == main_~Source~4[v_idx_93])) && main_~nodecount~4 + main_~i~4 <= 5) && ((main_~Weight~4[v_idx_68] + 10 == main_~edgecount~4 || ~INFINITY <= v_idx_68 + 888) || v_idx_68 + 10 < main_~edgecount~4)) && ((main_~Weight~4[v_idx_69] + 888 == ~INFINITY || v_idx_69 + 888 < ~INFINITY) || 17 <= v_idx_69 + main_~nodecount~4)) && ((main_~i~4 + 3 <= v_idx_98 || ~INFINITY == main_~Dest~4[v_idx_98] + 895) || v_idx_98 + main_~source~4 < 2)) && main_~i~4 + 899 <= ~INFINITY) && 5 <= main_~nodecount~4 + main_~source~4) && ~INFINITY <= main_~source~4 + 899) && main_~i~4 + 5 <= main_~nodecount~4) && ((v_idx_80 + ~INFINITY < 899 || 899 == main_~Source~4[v_idx_80] + ~INFINITY) || main_~nodecount~4 <= v_idx_80 + 4)) && main_~nodecount~4 <= main_~source~4 + 5) && ((13 <= v_idx_65 + main_~nodecount~4 || v_idx_65 + main_~edgecount~4 < 27) || main_~Weight~4[v_idx_65] + main_~edgecount~4 == 27)) && main_~nodecount~4 + main_~edgecount~4 <= 25) && ((27 <= v_idx_84 + main_~edgecount~4 || main_~source~4 + v_idx_84 < 6) || main_~nodecount~4 == main_~Source~4[v_idx_84] + 4)) && ((v_idx_86 + main_~nodecount~4 < 13 || ~INFINITY == main_~Source~4[v_idx_86] + 895) || main_~edgecount~4 <= v_idx_86 + 10)) && ((main_~i~4 + 17 == main_~Weight~4[v_idx_75] || 18 <= v_idx_75 + main_~source~4) || v_idx_75 < main_~i~4 + 17)) && ((25 <= v_idx_62 + main_~edgecount~4 || main_~Weight~4[v_idx_62] + 895 == ~INFINITY) || v_idx_62 + 895 < ~INFINITY)) && ((~INFINITY <= v_idx_61 + 895 || v_idx_61 < main_~i~4 + 3) || main_~i~4 + 3 == main_~Weight~4[v_idx_61])) && ((v_idx_106 + main_~edgecount~4 < 34 || 15 <= v_idx_106 + main_~i~4) || main_~i~4 + 3 == main_~Dest~4[v_idx_106])) && main_~nodecount~4 + 894 <= ~INFINITY) && ((25 == main_~edgecount~4 + main_~Weight~4[v_idx_63] || 6 <= v_idx_63 + main_~source~4) || v_idx_63 + main_~edgecount~4 < 25)) && ((18 == main_~Weight~4[v_idx_76] + main_~source~4 || 19 <= v_idx_76 + main_~source~4) || v_idx_76 + main_~source~4 < 18)) && ~INFINITY <= main_~i~4 + 899) && 899 <= main_~i~4 + ~INFINITY) && 1798 <= 2 * ~INFINITY) && main_~source~4 <= main_~i~4) && 2 * main_~source~4 <= 0) && ((main_~edgecount~4 <= v_idx_111 || ~INFINITY == main_~Dest~4[v_idx_111] + 895) || main_~source~4 + v_idx_111 < 19)) && ((main_~i~4 + 3 == main_~Dest~4[v_idx_97] || v_idx_97 + 4 < main_~nodecount~4) || 2 <= v_idx_97 + main_~source~4)) && 25 <= main_~nodecount~4 + main_~edgecount~4) && ((main_~i~4 + 17 <= v_idx_108 || v_idx_108 < main_~i~4 + 16) || main_~source~4 + main_~Dest~4[v_idx_108] == 2)) && ((v_idx_109 < main_~i~4 + 17 || 18 <= v_idx_109 + main_~source~4) || main_~nodecount~4 == main_~Dest~4[v_idx_109] + 4)) && 10 <= 2 * main_~nodecount~4) && main_~i~4 + ~INFINITY <= 899) && 904 <= main_~nodecount~4 + ~INFINITY) && ((main_~i~4 + 16 <= v_idx_107 || 899 == main_~Dest~4[v_idx_107] + ~INFINITY) || v_idx_107 + main_~i~4 < 15)) && ((~INFINITY == main_~Dest~4[v_idx_100] + 895 || main_~edgecount~4 + v_idx_100 < 25) || 6 <= main_~source~4 + v_idx_100)) - 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, 351.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 8.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 13 SDslu, 0 SDs, 0 SdLazy, 13 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 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, 335.7s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 6 NumberOfFragments, 1156 HoareAnnotationTreeSize, 5 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...