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/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:21:47,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:21:47,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:21:47,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:21:47,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:21:47,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:21:47,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:21:47,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:21:47,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:21:47,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:21:47,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:21:47,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:21:47,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:21:47,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:21:47,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:21:47,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:21:47,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:21:47,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:21:47,627 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:21:47,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:21:47,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:21:47,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:21:47,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:21:47,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:21:47,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:21:47,639 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:21:47,640 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:21:47,641 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:21:47,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:21:47,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:21:47,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:21:47,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:21:47,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:21:47,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:21:47,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:21:47,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:21:47,652 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-31 17:21:47,678 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:21:47,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:21:47,680 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:21:47,683 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:21:47,683 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:21:47,683 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:21:47,683 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:21:47,684 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:21:47,684 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:21:47,684 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:21:47,684 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:21:47,684 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:21:47,685 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:21:47,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:21:47,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:21:47,686 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:21:47,686 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:21:47,686 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:21:47,686 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:21:47,686 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:21:47,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:21:47,687 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:21:47,687 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:21:47,687 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:21:47,687 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:21:47,688 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:21:47,688 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:21:47,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:21:47,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:21:47,688 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:21:47,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:47,689 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:21:47,689 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:21:47,689 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:21:47,689 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:21:47,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:21:47,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:21:47,690 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:21:47,690 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:21:47,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:21:47,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:21:47,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:21:47,738 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:21:47,738 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:21:47,739 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-01-31 17:21:47,740 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-01-31 17:21:47,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:21:47,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:21:47,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:47,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:21:47,779 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:21:47,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,813 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-31 17:21:47,813 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-31 17:21:47,813 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-31 17:21:47,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:47,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:21:47,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:21:47,816 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:21:47,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/1) ... [2019-01-31 17:21:47,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:21:47,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:21:47,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:21:47,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:21:47,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-01-31 17:21:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-01-31 17:21:48,109 INFO L278 CfgBuilder]: Using library mode [2019-01-31 17:21:48,109 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-31 17:21:48,110 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:48 BoogieIcfgContainer [2019-01-31 17:21:48,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:21:48,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:21:48,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:21:48,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:21:48,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:47" (1/2) ... [2019-01-31 17:21:48,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b807b3 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:21:48, skipping insertion in model container [2019-01-31 17:21:48,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:48" (2/2) ... [2019-01-31 17:21:48,119 INFO L112 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bpl [2019-01-31 17:21:48,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:21:48,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 17:21:48,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 17:21:48,192 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:21:48,192 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:21:48,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:21:48,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:21:48,193 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:21:48,193 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:21:48,193 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:21:48,193 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:21:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2019-01-31 17:21:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:21:48,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:48,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:21:48,226 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash 965, now seen corresponding path program 1 times [2019-01-31 17:21:48,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,370 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-31 17:21:48,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:48,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:21:48,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:48,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:21:48,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:21:48,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:21:48,393 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2019-01-31 17:21:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:48,439 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 17:21:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:21:48,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:21:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:48,453 INFO L225 Difference]: With dead ends: 7 [2019-01-31 17:21:48,453 INFO L226 Difference]: Without dead ends: 4 [2019-01-31 17:21:48,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-31 17:21:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-01-31 17:21:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-01-31 17:21:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 17:21:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-31 17:21:48,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-01-31 17:21:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:48,490 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-01-31 17:21:48,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:21:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 17:21:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:21:48,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:48,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:21:48,491 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:48,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash 29950, now seen corresponding path program 1 times [2019-01-31 17:21:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,606 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-31 17:21:48,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:21:48,610 INFO L207 CegarAbsIntRunner]: [0], [4], [5] [2019-01-31 17:21:48,727 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:48,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:49,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:49,999 INFO L272 AbstractInterpreter]: Visited 3 different actions 17 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:21:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:50,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:50,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:50,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:50,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:50,074 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-31 17:21:50,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:50,307 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-31 17:21:50,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:50,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2019-01-31 17:21:50,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:50,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:50,347 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-01-31 17:21:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:50,427 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-01-31 17:21:50,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:21:50,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:21:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:50,428 INFO L225 Difference]: With dead ends: 6 [2019-01-31 17:21:50,429 INFO L226 Difference]: Without dead ends: 5 [2019-01-31 17:21:50,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:21:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-31 17:21:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-31 17:21:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 17:21:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-31 17:21:50,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-31 17:21:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:50,432 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-31 17:21:50,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-31 17:21:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:21:50,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:50,433 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-31 17:21:50,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash 928485, now seen corresponding path program 2 times [2019-01-31 17:21:50,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:50,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:50,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:50,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:50,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:50,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:50,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:50,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:21:50,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:50,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:50,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-01-31 17:21:50,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:50,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:21:50,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:21:50,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:50,747 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-01-31 17:21:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:50,767 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-01-31 17:21:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:21:50,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:21:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:50,769 INFO L225 Difference]: With dead ends: 7 [2019-01-31 17:21:50,769 INFO L226 Difference]: Without dead ends: 6 [2019-01-31 17:21:50,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:50,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-31 17:21:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-31 17:21:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 17:21:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-31 17:21:50,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-31 17:21:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:50,772 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-31 17:21:50,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:21:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-31 17:21:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:21:50,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:50,773 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1] [2019-01-31 17:21:50,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:50,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28783070, now seen corresponding path program 3 times [2019-01-31 17:21:50,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:50,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:50,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:50,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:50,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:50,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:50,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:50,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:50,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:50,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:50,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:51,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-01-31 17:21:51,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:51,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:21:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:21:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:51,127 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-01-31 17:21:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:51,173 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-31 17:21:51,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:21:51,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 17:21:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:51,174 INFO L225 Difference]: With dead ends: 8 [2019-01-31 17:21:51,174 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 17:21:51,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 17:21:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 17:21:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 17:21:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-31 17:21:51,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-31 17:21:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:51,177 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-31 17:21:51,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:21:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-31 17:21:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:21:51,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:51,178 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1] [2019-01-31 17:21:51,179 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash 892275205, now seen corresponding path program 4 times [2019-01-31 17:21:51,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:51,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:51,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:51,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:51,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:51,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:51,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:51,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:51,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:51,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-01-31 17:21:51,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:51,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:21:51,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:21:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:51,589 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-01-31 17:21:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:51,726 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 17:21:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:21:51,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 17:21:51,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:51,732 INFO L225 Difference]: With dead ends: 9 [2019-01-31 17:21:51,732 INFO L226 Difference]: Without dead ends: 8 [2019-01-31 17:21:51,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-31 17:21:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-31 17:21:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 17:21:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-31 17:21:51,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-31 17:21:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:51,736 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-31 17:21:51,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:21:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-31 17:21:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:21:51,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:51,741 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1] [2019-01-31 17:21:51,741 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727614, now seen corresponding path program 5 times [2019-01-31 17:21:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:51,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:51,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:51,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:51,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:51,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:21:51,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:51,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:51,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:21:51,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:51,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:52,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:21:52,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2019-01-31 17:21:52,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:21:52,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:21:52,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-01-31 17:21:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:21:52,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-31 17:21:52,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:52,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 11 [2019-01-31 17:21:52,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:52,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:21:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:21:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:21:52,841 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2019-01-31 17:21:53,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:53,169 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-31 17:21:53,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:21:53,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:21:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:53,170 INFO L225 Difference]: With dead ends: 9 [2019-01-31 17:21:53,170 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:21:53,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:21:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:21:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:21:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:21:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:21:53,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-31 17:21:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:53,172 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:21:53,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:21:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:21:53,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:21:53,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:21:53,261 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 12 25) the Hoare annotation is: (or (and (< 4 proc_j) (< proc_j 6) (<= proc_i 999) (<= (select proc_a 5) 1000)) (<= proc_i 0)) [2019-01-31 17:21:53,261 INFO L448 ceAbstractionStarter]: For program point procErr0ASSERT_VIOLATIONASSERT(line 18) no Hoare annotation was computed. [2019-01-31 17:21:53,261 INFO L448 ceAbstractionStarter]: For program point procEXIT(lines 12 25) no Hoare annotation was computed. [2019-01-31 17:21:53,262 INFO L448 ceAbstractionStarter]: For program point procENTRY(lines 12 25) no Hoare annotation was computed. [2019-01-31 17:21:53,270 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:21:53 BoogieIcfgContainer [2019-01-31 17:21:53,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:21:53,271 INFO L168 Benchmark]: Toolchain (without parser) took 5494.34 ms. Allocated memory was 133.7 MB in the beginning and 259.0 MB in the end (delta: 125.3 MB). Free memory was 106.6 MB in the beginning and 178.0 MB in the end (delta: -71.3 MB). Peak memory consumption was 54.0 MB. Max. memory is 7.1 GB. [2019-01-31 17:21:53,274 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 133.7 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:21:53,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 104.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-01-31 17:21:53,275 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 ms. Allocated memory is still 133.7 MB. Free memory was 104.7 MB in the beginning and 103.8 MB in the end (delta: 933.6 kB). Peak memory consumption was 933.6 kB. Max. memory is 7.1 GB. [2019-01-31 17:21:53,276 INFO L168 Benchmark]: RCFGBuilder took 270.09 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 95.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-01-31 17:21:53,277 INFO L168 Benchmark]: TraceAbstraction took 5159.11 ms. Allocated memory was 133.7 MB in the beginning and 259.0 MB in the end (delta: 125.3 MB). Free memory was 95.5 MB in the beginning and 178.0 MB in the end (delta: -82.5 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2019-01-31 17:21:53,281 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.24 ms. Allocated memory is still 133.7 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 133.7 MB. Free memory was 106.6 MB in the beginning and 104.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.46 ms. Allocated memory is still 133.7 MB. Free memory was 104.7 MB in the beginning and 103.8 MB in the end (delta: 933.6 kB). Peak memory consumption was 933.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 270.09 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 95.7 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5159.11 ms. Allocated memory was 133.7 MB in the beginning and 259.0 MB in the end (delta: 125.3 MB). Free memory was 95.5 MB in the beginning and 178.0 MB in the end (delta: -82.5 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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: 12]: Loop Invariant Derived loop invariant: (((4 < j && j < 6) && i <= 999) && a[5] <= 1000) || i <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 1 SDslu, 2 SDs, 0 SdLazy, 38 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 7 NumberOfFragments, 19 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 75 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 52 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 5 NumberOfNonLiveVariables, 121 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 22/105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...