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/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:10:32,690 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:10:32,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:10:32,711 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:10:32,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:10:32,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:10:32,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:10:32,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:10:32,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:10:32,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:10:32,730 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:10:32,730 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:10:32,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:10:32,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:10:32,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:10:32,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:10:32,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:10:32,737 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:10:32,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:10:32,740 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:10:32,741 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:10:32,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:10:32,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:10:32,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:10:32,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:10:32,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:10:32,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:10:32,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:10:32,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:10:32,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:10:32,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:10:32,750 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:10:32,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:10:32,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:10:32,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:10:32,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:10:32,753 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-01-11 14:10:32,766 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:10:32,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:10:32,767 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:10:32,767 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:10:32,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:10:32,768 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:10:32,768 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:10:32,768 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:10:32,768 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:10:32,768 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:10:32,769 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:10:32,769 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:10:32,769 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:10:32,769 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:10:32,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:10:32,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:10:32,770 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:10:32,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:10:32,771 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:10:32,771 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:10:32,771 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:10:32,771 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:10:32,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:10:32,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:10:32,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:10:32,772 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:10:32,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:10:32,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:10:32,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:10:32,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:10:32,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:10:32,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:32,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:10:32,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:10:32,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:10:32,774 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:10:32,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:10:32,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:10:32,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:10:32,775 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:10:32,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:10:32,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:10:32,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:10:32,836 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:10:32,837 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:10:32,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-11 14:10:32,838 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-11 14:10:32,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:10:32,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:10:32,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:32,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:10:32,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:10:32,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,920 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 14:10:32,920 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 14:10:32,920 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 14:10:32,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:32,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:10:32,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:10:32,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:10:32,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... [2019-01-11 14:10:32,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:10:32,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:10:32,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:10:32,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:10:32,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:33,009 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-11 14:10:33,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 14:10:33,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 14:10:33,193 INFO L278 CfgBuilder]: Using library mode [2019-01-11 14:10:33,194 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-11 14:10:33,195 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:33 BoogieIcfgContainer [2019-01-11 14:10:33,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:10:33,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:10:33,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:10:33,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:10:33,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:32" (1/2) ... [2019-01-11 14:10:33,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1b535d and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:10:33, skipping insertion in model container [2019-01-11 14:10:33,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:33" (2/2) ... [2019-01-11 14:10:33,209 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-11 14:10:33,219 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:10:33,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:10:33,245 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:10:33,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:10:33,279 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:10:33,279 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:10:33,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:10:33,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:10:33,280 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:10:33,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:10:33,280 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:10:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-11 14:10:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:10:33,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:33,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:10:33,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-11 14:10:33,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:33,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:33,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:10:33,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:33,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:10:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:10:33,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:33,463 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-11 14:10:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:33,498 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-11 14:10:33,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:10:33,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:10:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:33,512 INFO L225 Difference]: With dead ends: 11 [2019-01-11 14:10:33,512 INFO L226 Difference]: Without dead ends: 5 [2019-01-11 14:10:33,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:33,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-11 14:10:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-11 14:10:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-11 14:10:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-11 14:10:33,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-11 14:10:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:33,551 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-11 14:10:33,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:10:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-11 14:10:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:10:33,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:33,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:10:33,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:33,554 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-11 14:10:33,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:33,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:33,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:33,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:33,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:10:33,857 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-11 14:10:33,890 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:33,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:34,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:34,005 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:10:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:34,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:34,012 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-11 14:10:34,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:34,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:34,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:34,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:34,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:34,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:34,622 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-11 14:10:34,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:10:34,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:34,698 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-11 14:10:34,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:10:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:34,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:34,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-11 14:10:34,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:34,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:10:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:10:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:10:34,749 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-01-11 14:10:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,818 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-11 14:10:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:34,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-11 14:10:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,820 INFO L225 Difference]: With dead ends: 8 [2019-01-11 14:10:34,820 INFO L226 Difference]: Without dead ends: 6 [2019-01-11 14:10:34,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:10:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-11 14:10:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-11 14:10:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-11 14:10:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-11 14:10:34,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-11 14:10:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,824 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-11 14:10:34,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:10:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-11 14:10:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:10:34,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,825 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:10:34,826 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-01-11 14:10:34,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:35,083 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-11 14:10:35,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:35,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:35,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:35,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,084 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-11 14:10:35,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:35,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:35,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:10:35,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:35,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:35,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:35,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:35,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:35,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:35,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:10:35,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:35,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:35,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:10:35,447 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-11 14:10:35,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:35,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:10:35,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:35,703 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-11 14:10:35,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:10:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:10:35,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:35,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-11 14:10:35,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:35,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:10:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:10:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:10:35,886 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-01-11 14:10:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:36,046 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-11 14:10:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:10:36,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:10:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:36,050 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:10:36,050 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 14:10:36,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:10:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 14:10:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 14:10:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:10:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-11 14:10:36,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-11 14:10:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:36,055 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-11 14:10:36,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:10:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-11 14:10:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:10:36,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:36,056 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 14:10:36,056 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-01-11 14:10:36,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:36,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:36,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:36,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:36,452 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-01-11 14:10:36,497 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-11 14:10:36,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:36,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:36,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:36,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,499 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-11 14:10:36,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:36,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:36,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:36,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:36,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:36,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:36,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:36,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:36,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:36,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:10:36,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:36,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:36,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:10:36,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:10:36,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:36,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:36,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:10:36,839 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-11 14:10:36,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:36,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:10:36,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:37,013 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-11 14:10:37,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:10:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:10:37,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:37,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-01-11 14:10:37,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:37,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:10:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:10:37,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:10:37,043 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-01-11 14:10:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:37,219 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-11 14:10:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:10:37,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:10:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:37,220 INFO L225 Difference]: With dead ends: 10 [2019-01-11 14:10:37,220 INFO L226 Difference]: Without dead ends: 8 [2019-01-11 14:10:37,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:10:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-11 14:10:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-11 14:10:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:10:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-11 14:10:37,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-11 14:10:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:37,224 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-11 14:10:37,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:10:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-11 14:10:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:10:37,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:37,225 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-11 14:10:37,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-01-11 14:10:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:37,547 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-01-11 14:10:37,674 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-01-11 14:10:37,733 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-11 14:10:37,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:37,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:37,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:37,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,737 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-11 14:10:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:37,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:37,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:37,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:37,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:37,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:37,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:37,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:10:37,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:37,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:37,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:10:37,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:10:37,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:37,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:37,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:10:37,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:10:37,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:38,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:38,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-11 14:10:38,094 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-11 14:10:38,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:38,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:10:38,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:38,338 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-11 14:10:38,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:10:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 14:10:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-01-11 14:10:38,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:10:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:10:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:10:38,366 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-01-11 14:10:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:38,642 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-11 14:10:38,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:10:38,643 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 14:10:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:38,644 INFO L225 Difference]: With dead ends: 11 [2019-01-11 14:10:38,644 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:10:38,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:10:38,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:10:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 14:10:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:10:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-11 14:10:38,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-11 14:10:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:38,648 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-11 14:10:38,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:10:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-11 14:10:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:10:38,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:38,649 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-11 14:10:38,650 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-01-11 14:10:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:38,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,111 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-01-11 14:10:39,133 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-11 14:10:39,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:39,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:39,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:39,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,135 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-11 14:10:39,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:39,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:39,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:10:39,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:39,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:39,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:39,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:39,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:39,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:39,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:10:39,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:39,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:39,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:10:39,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:10:39,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:39,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:39,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:10:39,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:10:39,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:39,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:39,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-11 14:10:39,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:10:39,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:39,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:39,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-11 14:10:39,961 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-11 14:10:39,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:46,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:10:46,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:46,152 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-11 14:10:46,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:10:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 14:10:46,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-01-11 14:10:46,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:46,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 14:10:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 14:10:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:10:46,182 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-01-11 14:10:46,871 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-11 14:10:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:46,886 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-11 14:10:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:10:46,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-11 14:10:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:46,887 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:10:46,887 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 14:10:46,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:10:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 14:10:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-11 14:10:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 14:10:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-11 14:10:46,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-11 14:10:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:46,893 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-11 14:10:46,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 14:10:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-11 14:10:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:10:46,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:46,894 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-11 14:10:46,894 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:46,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:46,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-01-11 14:10:46,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:46,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:46,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:46,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:47,370 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-01-11 14:10:47,582 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-01-11 14:10:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:47,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:47,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:47,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:47,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,609 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:47,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:47,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:47,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:47,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:47,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:47,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:47,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:47,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:47,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:10:47,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:47,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:47,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:10:47,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:10:47,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:47,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:47,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:10:47,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:10:47,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:47,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:47,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-11 14:10:47,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:10:47,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:47,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:47,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-11 14:10:48,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-11 14:10:48,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:48,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:48,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-11 14:10:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:50,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:51,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:10:51,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:51,922 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-11 14:10:51,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:10:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 14:10:51,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:51,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-01-11 14:10:51,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:51,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 14:10:51,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 14:10:51,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:10:51,968 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-01-11 14:10:56,944 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-11 14:10:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:56,958 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-11 14:10:56,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:10:56,958 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-11 14:10:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:56,959 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:10:56,959 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:10:56,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-01-11 14:10:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:10:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 14:10:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:10:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 14:10:56,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-11 14:10:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:56,965 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 14:10:56,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 14:10:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 14:10:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:10:56,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:56,965 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-11 14:10:56,966 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-01-11 14:10:56,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:56,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:56,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:57,464 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-01-11 14:10:57,622 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-01-11 14:10:57,862 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-11 14:10:58,146 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-01-11 14:10:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:58,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:58,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:58,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:58,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,171 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:58,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:58,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:58,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:58,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:58,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:58,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:10:58,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:10:58,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:58,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:10:58,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:10:58,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:58,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:10:58,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:10:58,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:58,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-11 14:10:58,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:10:58,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:58,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-11 14:10:58,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-11 14:10:58,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-11 14:10:58,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-11 14:11:01,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-11 14:11:01,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:01,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-11 14:11:01,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-11 14:11:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:11:14,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:23,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:11:23,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:23,429 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-11 14:11:23,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:11:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 14:11:23,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:23,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-01-11 14:11:23,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:23,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 14:11:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 14:11:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=308, Unknown=4, NotChecked=0, Total=420 [2019-01-11 14:11:23,461 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-01-11 14:11:38,835 WARN L181 SmtUtils]: Spent 8.72 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2019-01-11 14:11:52,640 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-01-11 14:12:17,246 WARN L181 SmtUtils]: Spent 9.94 s on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-01-11 14:12:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:17,272 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-11 14:12:17,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:12:17,272 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-01-11 14:12:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:17,273 INFO L225 Difference]: With dead ends: 14 [2019-01-11 14:12:17,273 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 14:12:17,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 68.5s TimeCoverageRelationStatistics Valid=181, Invalid=510, Unknown=11, NotChecked=0, Total=702 [2019-01-11 14:12:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 14:12:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 14:12:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 14:12:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-11 14:12:17,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-11 14:12:17,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:17,279 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-11 14:12:17,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 14:12:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-11 14:12:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 14:12:17,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:17,280 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-11 14:12:17,280 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-01-11 14:12:17,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:17,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:17,896 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 26 [2019-01-11 14:12:18,068 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 30 [2019-01-11 14:12:18,523 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2019-01-11 14:12:19,163 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2019-01-11 14:12:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:12:19,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:19,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:19,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:19,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:19,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:19,185 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:19,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:19,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:19,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 14:12:19,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:19,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:19,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:12:19,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:19,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:19,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:12:19,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:12:19,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:19,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:19,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:12:19,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:12:19,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:19,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:19,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:12:19,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:12:19,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:19,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:19,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-11 14:12:19,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:12:19,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:19,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:19,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-11 14:12:19,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-11 14:12:19,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:19,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:19,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-11 14:12:23,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-11 14:12:23,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:23,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:23,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-11 14:12:34,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-11 14:12:34,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:34,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-01-11 14:12:34,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2019-01-11 14:13:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:13:05,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:22,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-11 14:13:22,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:22,127 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-11 14:13:22,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-11 14:13:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 14:13:22,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:22,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 3] total 21 [2019-01-11 14:13:22,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:22,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 14:13:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 14:13:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=361, Unknown=15, NotChecked=0, Total=506 [2019-01-11 14:13:22,163 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2019-01-11 14:13:41,085 WARN L181 SmtUtils]: Spent 11.46 s on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-01-11 14:14:09,524 WARN L181 SmtUtils]: Spent 12.60 s on a formula simplification. DAG size of input: 119 DAG size of output: 53 [2019-01-11 14:15:00,969 WARN L181 SmtUtils]: Spent 11.89 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2019-01-11 14:15:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:01,001 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-11 14:15:01,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:15:01,001 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2019-01-11 14:15:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:01,002 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:15:01,002 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 14:15:01,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 136.7s TimeCoverageRelationStatistics Valid=181, Invalid=547, Unknown=28, NotChecked=0, Total=756 [2019-01-11 14:15:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 14:15:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 14:15:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:15:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-11 14:15:01,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-11 14:15:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:01,008 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-11 14:15:01,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 14:15:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-11 14:15:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 14:15:01,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:01,008 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-11 14:15:01,009 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:15:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:01,009 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-01-11 14:15:01,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:01,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:01,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:02,005 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2019-01-11 14:15:02,139 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 32 [2019-01-11 14:15:02,782 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 34 [2019-01-11 14:15:03,259 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 45 [2019-01-11 14:15:03,819 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 59 [2019-01-11 14:15:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:15:03,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:03,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:03,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:03,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:03,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:03,845 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:03,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:03,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:03,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:03,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:03,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:03,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:15:03,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:03,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:03,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-11 14:15:03,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-11 14:15:03,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:03,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:03,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-11 14:15:04,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-11 14:15:04,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:04,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:04,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-11 14:15:04,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:15:04,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:04,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:04,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-11 14:15:04,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 14:15:04,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:04,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:04,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-11 14:15:04,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-11 14:15:04,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:04,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:04,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-11 14:15:07,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-11 14:15:07,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:07,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-11 14:15:07,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-11 14:15:10,041 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:15:10,043 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-11 14:15:10,048 INFO L168 Benchmark]: Toolchain (without parser) took 277166.74 ms. Allocated memory was 141.6 MB in the beginning and 298.8 MB in the end (delta: 157.3 MB). Free memory was 109.0 MB in the beginning and 104.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 162.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:15:10,049 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:15:10,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:15:10,050 INFO L168 Benchmark]: Boogie Preprocessor took 21.00 ms. Allocated memory is still 141.6 MB. Free memory was 107.1 MB in the beginning and 106.1 MB in the end (delta: 969.7 kB). Peak memory consumption was 969.7 kB. Max. memory is 7.1 GB. [2019-01-11 14:15:10,050 INFO L168 Benchmark]: RCFGBuilder took 250.94 ms. Allocated memory is still 141.6 MB. Free memory was 105.9 MB in the beginning and 97.2 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-01-11 14:15:10,051 INFO L168 Benchmark]: TraceAbstraction took 276849.59 ms. Allocated memory was 141.6 MB in the beginning and 298.8 MB in the end (delta: 157.3 MB). Free memory was 97.0 MB in the beginning and 104.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 150.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:15:10,053 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.22 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.30 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.00 ms. Allocated memory is still 141.6 MB. Free memory was 107.1 MB in the beginning and 106.1 MB in the end (delta: 969.7 kB). Peak memory consumption was 969.7 kB. Max. memory is 7.1 GB. * RCFGBuilder took 250.94 ms. Allocated memory is still 141.6 MB. Free memory was 105.9 MB in the beginning and 97.2 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 276849.59 ms. Allocated memory was 141.6 MB in the beginning and 298.8 MB in the end (delta: 157.3 MB). Free memory was 97.0 MB in the beginning and 104.2 MB in the end (delta: -7.2 MB). Peak memory consumption was 150.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...