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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:20,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:20,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:20,913 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:20,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:20,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:20,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:20,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:20,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:20,920 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:20,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:20,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:20,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:20,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:20,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:20,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:20,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:20,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:20,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:20,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:20,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:20,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:20,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:20,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:20,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:20,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:20,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:20,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:20,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:20,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:20,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:20,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:20,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:20,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:20,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:20,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:20,946 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:10:20,958 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:20,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:20,959 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:20,960 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:20,960 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:20,960 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:20,960 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:20,960 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:20,964 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:20,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:20,964 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:20,964 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:20,965 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:20,965 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:20,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:20,966 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:20,966 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:20,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:20,966 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:20,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:20,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:20,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:20,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:20,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:20,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:20,968 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:20,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:20,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:20,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:20,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:20,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:20,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:20,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:20,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:20,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:20,972 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:20,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:20,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:20,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:20,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:21,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:21,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:21,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:21,024 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:21,025 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:21,026 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2019-02-28 10:10:21,026 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-02-28 10:10:21,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:21,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:21,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:21,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:21,071 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:21,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:21,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:21,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:21,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:21,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... [2019-02-28 10:10:21,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:21,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:21,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:21,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:21,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:21,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:21,522 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-28 10:10:21,523 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:21,524 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-28 10:10:21,525 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:21 BoogieIcfgContainer [2019-02-28 10:10:21,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:21,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:21,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:21,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:21,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:21" (1/2) ... [2019-02-28 10:10:21,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1d5c0 and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:21, skipping insertion in model container [2019-02-28 10:10:21,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:21" (2/2) ... [2019-02-28 10:10:21,533 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2019-02-28 10:10:21,551 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:21,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:21,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:21,642 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:21,643 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:21,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:21,643 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:21,643 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:21,643 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:21,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:21,644 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:10:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:10:21,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:10:21,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-02-28 10:10:21,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:21,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:10:21,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:21,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:21,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:21,939 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:10:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:22,020 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-28 10:10:22,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:22,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-02-28 10:10:22,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:22,034 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:10:22,035 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:10:22,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:10:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-28 10:10:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:10:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-02-28 10:10:22,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-02-28 10:10:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:22,070 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-02-28 10:10:22,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-02-28 10:10:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:22,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:22,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:10:22,072 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash 894129427, now seen corresponding path program 1 times [2019-02-28 10:10:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:22,235 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-28 10:10:22,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:22,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:10:22,239 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [23] [2019-02-28 10:10:22,279 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:22,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:22,418 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:10:22,420 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 1 different actions 3 times. Never widened. Performed 116 root evaluator evaluations with a maximum evaluation depth of 4. Performed 116 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:10:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:22,428 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:10:22,437 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:10:22,515 INFO L420 sIntCurrentIteration]: We unified 5 AI predicates to 5 [2019-02-28 10:10:22,515 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:10:22,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:10:22,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-28 10:10:22,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:22,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:22,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:22,520 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2019-02-28 10:10:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:22,799 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-02-28 10:10:22,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:22,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:10:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:22,801 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:10:22,801 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:10:22,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:10:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2019-02-28 10:10:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:10:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-02-28 10:10:22,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2019-02-28 10:10:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:22,806 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-02-28 10:10:22,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-02-28 10:10:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:10:22,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:22,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:22,808 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:22,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1948261215, now seen corresponding path program 1 times [2019-02-28 10:10:22,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,127 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-02-28 10:10:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:23,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:10:23,133 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [19], [23] [2019-02-28 10:10:23,138 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:23,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:23,180 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:10:23,180 INFO L272 AbstractInterpreter]: Visited 6 different actions 20 times. Merged at 3 different actions 8 times. Widened at 1 different actions 1 times. Performed 208 root evaluator evaluations with a maximum evaluation depth of 5. Performed 208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 10:10:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,183 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:10:23,185 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:10:23,229 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-28 10:10:23,230 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:10:23,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:10:23,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-28 10:10:23,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:23,232 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 4 states. [2019-02-28 10:10:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:23,535 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-02-28 10:10:23,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:23,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-28 10:10:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:23,536 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:10:23,536 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:10:23,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:10:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 9. [2019-02-28 10:10:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:10:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-02-28 10:10:23,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 7 [2019-02-28 10:10:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:23,541 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-02-28 10:10:23,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-02-28 10:10:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:10:23,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:23,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:23,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,543 INFO L82 PathProgramCache]: Analyzing trace with hash 264986107, now seen corresponding path program 1 times [2019-02-28 10:10:23,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:10:23,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:10:23,698 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [21], [23], [29] [2019-02-28 10:10:23,701 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:23,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:23,719 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:10:23,719 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 3 times. Never widened. Performed 121 root evaluator evaluations with a maximum evaluation depth of 5. Performed 121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:10:23,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,719 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:10:23,721 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:10:23,800 INFO L420 sIntCurrentIteration]: We unified 7 AI predicates to 7 [2019-02-28 10:10:23,801 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:10:23,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:10:23,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2019-02-28 10:10:23,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:23,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:10:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:10:23,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:23,803 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 5 states. [2019-02-28 10:10:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,002 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2019-02-28 10:10:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:24,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-28 10:10:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,004 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:10:24,005 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:10:24,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:10:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:10:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:10:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:10:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-02-28 10:10:24,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2019-02-28 10:10:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,011 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-02-28 10:10:24,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:10:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-02-28 10:10:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:24,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:10:24,012 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -375296184, now seen corresponding path program 1 times [2019-02-28 10:10:24,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,187 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-02-28 10:10:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:10:24,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:24,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:10:24,189 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [19], [21], [23], [29], [31] [2019-02-28 10:10:24,267 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:24,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:24,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:24,296 INFO L272 AbstractInterpreter]: Visited 9 different actions 34 times. Merged at 7 different actions 16 times. Widened at 1 different actions 1 times. Performed 392 root evaluator evaluations with a maximum evaluation depth of 5. Performed 392 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-28 10:10:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:24,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,298 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-02-28 10:10:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:10:24,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:10:24,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:24,472 INFO L442 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2019-02-28 10:10:24,474 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:24,475 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:24,476 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:5 [2019-02-28 10:10:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-28 10:10:24,515 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:10:24,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [3] total 8 [2019-02-28 10:10:24,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:24,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:24,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:24,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:24,516 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2019-02-28 10:10:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,623 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-28 10:10:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:24,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-28 10:10:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,626 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:10:24,626 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:10:24,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:10:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:10:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:10:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:10:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:10:24,628 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-28 10:10:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,630 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:10:24,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:10:24,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:10:24,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:10:24,720 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 124) no Hoare annotation was computed. [2019-02-28 10:10:24,721 INFO L444 ceAbstractionStarter]: At program point L83(lines 54 83) the Hoare annotation is: (not (= ULTIMATE.start_main_~i~5 0)) [2019-02-28 10:10:24,721 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 102) no Hoare annotation was computed. [2019-02-28 10:10:24,721 INFO L444 ceAbstractionStarter]: At program point L96(lines 96 101) the Hoare annotation is: false [2019-02-28 10:10:24,721 INFO L451 ceAbstractionStarter]: At program point L63(lines 44 63) the Hoare annotation is: true [2019-02-28 10:10:24,721 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 124) no Hoare annotation was computed. [2019-02-28 10:10:24,721 INFO L444 ceAbstractionStarter]: At program point L123(lines 100 123) the Hoare annotation is: false [2019-02-28 10:10:24,721 INFO L444 ceAbstractionStarter]: At program point L113(lines 77 113) the Hoare annotation is: (and (= ULTIMATE.start_main_~cont~5 0) (= (select ULTIMATE.start_main_~string_entrada~5 0) 0) (= ULTIMATE.start_main_~cont_aux~5 0) (= ULTIMATE.start_main_~i~5 0)) [2019-02-28 10:10:24,728 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:10:24 BoogieIcfgContainer [2019-02-28 10:10:24,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:10:24,729 INFO L168 Benchmark]: Toolchain (without parser) took 3660.18 ms. Allocated memory was 136.8 MB in the beginning and 209.7 MB in the end (delta: 72.9 MB). Free memory was 104.0 MB in the beginning and 168.7 MB in the end (delta: -64.7 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:24,730 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory is still 105.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:10:24,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.44 ms. Allocated memory is still 136.8 MB. Free memory was 104.0 MB in the beginning and 102.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:24,732 INFO L168 Benchmark]: Boogie Preprocessor took 22.29 ms. Allocated memory is still 136.8 MB. Free memory was 102.3 MB in the beginning and 101.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:24,733 INFO L168 Benchmark]: RCFGBuilder took 395.38 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 89.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:10:24,733 INFO L168 Benchmark]: TraceAbstraction took 3201.74 ms. Allocated memory was 136.8 MB in the beginning and 209.7 MB in the end (delta: 72.9 MB). Free memory was 89.8 MB in the beginning and 168.7 MB in the end (delta: -78.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:10:24,738 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.21 ms. Allocated memory is still 136.8 MB. Free memory is still 105.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.44 ms. Allocated memory is still 136.8 MB. Free memory was 104.0 MB in the beginning and 102.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.29 ms. Allocated memory is still 136.8 MB. Free memory was 102.3 MB in the beginning and 101.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 395.38 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 89.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3201.74 ms. Allocated memory was 136.8 MB in the beginning and 209.7 MB in the end (delta: 72.9 MB). Free memory was 89.8 MB in the beginning and 168.7 MB in the end (delta: -78.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: 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: 44]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((main_~cont~5 == 0 && main_~string_entrada~5[0] == 0) && main_~cont_aux~5 == 0) && main_~i~5 == 0 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: !(main_~i~5 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 16 SDslu, 11 SDs, 0 SdLazy, 50 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 22 HoareAnnotationTreeSize, 5 FomulaSimplifications, 96 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 11 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 918 SizeOfPredicates, 5 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...