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-299a4a8 [2018-12-04 11:42:59,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:59,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:59,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:59,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:59,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:59,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:59,863 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:59,865 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:59,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:59,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:59,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:59,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:59,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:59,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:59,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:59,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:59,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:59,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:59,895 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:59,896 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:59,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:59,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:59,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:59,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:59,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:59,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:59,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:59,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:59,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:59,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:59,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:59,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:59,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:59,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:59,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:59,919 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 [2018-12-04 11:42:59,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:59,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:59,944 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:59,944 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:59,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:59,944 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:59,944 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:59,945 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:59,945 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:59,945 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:59,945 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:59,945 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:59,945 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:59,946 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:59,946 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:59,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:59,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:59,947 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:59,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:59,947 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:59,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:59,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:59,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:59,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:59,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:59,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:59,949 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:59,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:59,949 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:59,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:59,950 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:59,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:59,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:59,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:59,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:59,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:59,951 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:59,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:59,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:59,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:59,951 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:59,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:59,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:43:00,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:43:00,003 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:43:00,003 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:43:00,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-12-04 11:43:00,005 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-12-04 11:43:00,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:43:00,044 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:43:00,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:43:00,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:43:00,046 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:43:00,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,084 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-04 11:43:00,085 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-04 11:43:00,085 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-04 11:43:00,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:43:00,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:43:00,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:43:00,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:43:00,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... [2018-12-04 11:43:00,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:43:00,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:43:00,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:43:00,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:43:00,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:43:00,198 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-04 11:43:00,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-04 11:43:00,199 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-04 11:43:00,437 INFO L272 CfgBuilder]: Using library mode [2018-12-04 11:43:00,438 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-04 11:43:00,438 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:43:00 BoogieIcfgContainer [2018-12-04 11:43:00,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:43:00,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:43:00,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:43:00,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:43:00,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:43:00" (1/2) ... [2018-12-04 11:43:00,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60644ba4 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:43:00, skipping insertion in model container [2018-12-04 11:43:00,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:43:00" (2/2) ... [2018-12-04 11:43:00,447 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-12-04 11:43:00,457 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:43:00,465 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:43:00,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:43:00,526 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:43:00,527 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:43:00,527 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:43:00,527 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:43:00,528 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:43:00,528 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:43:00,528 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:43:00,528 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:43:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 11:43:00,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-04 11:43:00,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:00,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-04 11:43:00,557 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:00,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-04 11:43:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:00,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:43:00,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:43:00,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:43:00,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:43:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:43:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:43:00,757 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-04 11:43:00,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:00,797 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-04 11:43:00,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:43:00,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-04 11:43:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:00,809 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:43:00,810 INFO L226 Difference]: Without dead ends: 5 [2018-12-04 11:43:00,813 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 [2018-12-04 11:43:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-04 11:43:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-04 11:43:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-04 11:43:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-04 11:43:00,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-04 11:43:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:00,846 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-04 11:43:00,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:43:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-04 11:43:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:43:00,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:00,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:43:00,848 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:00,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:00,848 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-04 11:43:00,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:00,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:01,190 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-04 11:43:01,192 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-04 11:43:01,225 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:43:01,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:43:01,349 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:43:01,351 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. [2018-12-04 11:43:01,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:01,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:43:01,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:01,395 INFO L192 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 [2018-12-04 11:43:01,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:01,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:01,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:01,650 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 [2018-12-04 11:43:01,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:01,760 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. [2018-12-04 11:43:01,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:02,296 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-04 11:43:02,319 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 [2018-12-04 11:43:02,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:02,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:02,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:02,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-04 11:43:02,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:02,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:43:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:43:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-04 11:43:02,429 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-12-04 11:43:02,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:02,555 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-04 11:43:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:43:02,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-12-04 11:43:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:02,557 INFO L225 Difference]: With dead ends: 8 [2018-12-04 11:43:02,557 INFO L226 Difference]: Without dead ends: 6 [2018-12-04 11:43:02,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:43:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-04 11:43:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-04 11:43:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-04 11:43:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-04 11:43:02,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-04 11:43:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:02,561 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-04 11:43:02,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:43:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-04 11:43:02,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:43:02,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:02,562 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-04 11:43:02,563 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:02,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:02,563 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-12-04 11:43:02,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:02,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:02,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:02,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:02,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:02,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,813 INFO L192 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 [2018-12-04 11:43:02,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:02,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:02,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:43:02,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:02,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:02,920 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 [2018-12-04 11:43:02,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:02,939 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. [2018-12-04 11:43:02,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:02,978 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 [2018-12-04 11:43:02,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:02,995 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. [2018-12-04 11:43:02,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:43:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:03,277 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 [2018-12-04 11:43:03,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:03,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:03,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:43:03,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:03,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-04 11:43:03,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:03,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:43:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:43:03,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-04 11:43:03,572 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-12-04 11:43:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:03,748 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-04 11:43:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:43:03,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-04 11:43:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:03,749 INFO L225 Difference]: With dead ends: 9 [2018-12-04 11:43:03,749 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:43:03,750 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 [2018-12-04 11:43:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:43:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:43:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:43:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-04 11:43:03,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-04 11:43:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:03,754 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-04 11:43:03,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:43:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-04 11:43:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:43:03,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:03,755 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-04 11:43:03,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:03,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-12-04 11:43:03,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:03,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:04,027 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-12-04 11:43:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:04,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:04,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:04,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:04,059 INFO L192 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 [2018-12-04 11:43:04,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:04,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:04,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:04,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:04,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:04,098 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 [2018-12-04 11:43:04,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:04,110 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. [2018-12-04 11:43:04,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:04,137 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 [2018-12-04 11:43:04,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:04,151 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. [2018-12-04 11:43:04,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:43:04,206 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 [2018-12-04 11:43:04,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:04,231 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. [2018-12-04 11:43:04,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-04 11:43:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:04,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:04,584 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 [2018-12-04 11:43:04,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:04,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:04,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:43:04,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:04,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2018-12-04 11:43:04,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:04,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:43:04,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:43:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-04 11:43:04,678 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-12-04 11:43:04,865 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 20 [2018-12-04 11:43:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:04,964 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-04 11:43:04,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:43:04,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-04 11:43:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:04,966 INFO L225 Difference]: With dead ends: 10 [2018-12-04 11:43:04,966 INFO L226 Difference]: Without dead ends: 8 [2018-12-04 11:43:04,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-04 11:43:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-04 11:43:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-04 11:43:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:43:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-04 11:43:04,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-04 11:43:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:04,970 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-04 11:43:04,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:43:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-04 11:43:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:43:04,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:04,972 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-04 11:43:04,972 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:04,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-12-04 11:43:04,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:04,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,327 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2018-12-04 11:43:05,479 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-12-04 11:43:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:05,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:05,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:05,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,556 INFO L192 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 [2018-12-04 11:43:05,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:05,585 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 [2018-12-04 11:43:05,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:05,595 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. [2018-12-04 11:43:05,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:05,641 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 [2018-12-04 11:43:05,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:05,656 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. [2018-12-04 11:43:05,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:43:05,701 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 [2018-12-04 11:43:05,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:05,716 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. [2018-12-04 11:43:05,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-04 11:43:05,760 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 [2018-12-04 11:43:05,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:05,798 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. [2018-12-04 11:43:05,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-04 11:43:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:08,160 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 [2018-12-04 11:43:08,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:08,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:08,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:43:08,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:08,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2018-12-04 11:43:08,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:08,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:43:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:43:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2018-12-04 11:43:08,195 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-12-04 11:43:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:08,462 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-04 11:43:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:43:08,462 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-04 11:43:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:08,463 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:43:08,463 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:43:08,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=82, Invalid=223, Unknown=1, NotChecked=0, Total=306 [2018-12-04 11:43:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:43:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:43:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:43:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-04 11:43:08,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-04 11:43:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:08,467 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-04 11:43:08,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:43:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-04 11:43:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:43:08,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:08,468 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-04 11:43:08,468 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:08,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:08,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-12-04 11:43:08,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:08,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:08,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,961 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-12-04 11:43:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:09,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:09,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:09,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:09,010 INFO L192 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 [2018-12-04 11:43:09,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:09,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:09,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:43:09,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:09,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:09,058 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 [2018-12-04 11:43:09,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,071 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. [2018-12-04 11:43:09,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:09,096 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 [2018-12-04 11:43:09,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,105 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. [2018-12-04 11:43:09,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:43:09,231 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 [2018-12-04 11:43:09,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,245 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. [2018-12-04 11:43:09,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-04 11:43:09,367 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 [2018-12-04 11:43:09,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,388 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. [2018-12-04 11:43:09,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-04 11:43:09,544 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 [2018-12-04 11:43:09,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,572 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. [2018-12-04 11:43:09,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-04 11:43:09,978 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:09,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:13,995 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 [2018-12-04 11:43:13,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:14,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:14,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:43:14,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:14,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2018-12-04 11:43:14,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:14,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:43:14,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:43:14,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=196, Unknown=1, NotChecked=0, Total=272 [2018-12-04 11:43:14,031 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-12-04 11:43:14,641 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-04 11:43:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:14,658 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-04 11:43:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:43:14,658 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-12-04 11:43:14,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:14,659 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:43:14,659 INFO L226 Difference]: Without dead ends: 10 [2018-12-04 11:43:14,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2018-12-04 11:43:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-04 11:43:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-04 11:43:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:43:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-04 11:43:14,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-04 11:43:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:14,665 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-04 11:43:14,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:43:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-04 11:43:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:43:14,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:14,666 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-04 11:43:14,666 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:14,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-12-04 11:43:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:14,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:14,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:15,191 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2018-12-04 11:43:15,398 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-12-04 11:43:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:15,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:15,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:15,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,422 INFO L192 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 [2018-12-04 11:43:15,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:15,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:15,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:15,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:15,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:15,465 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 [2018-12-04 11:43:15,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,472 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. [2018-12-04 11:43:15,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:15,501 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 [2018-12-04 11:43:15,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,511 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. [2018-12-04 11:43:15,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:43:15,540 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 [2018-12-04 11:43:15,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,557 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. [2018-12-04 11:43:15,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-04 11:43:15,620 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 [2018-12-04 11:43:15,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,640 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. [2018-12-04 11:43:15,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-04 11:43:15,714 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 [2018-12-04 11:43:15,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,740 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. [2018-12-04 11:43:15,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-04 11:43:15,946 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 [2018-12-04 11:43:15,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,978 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. [2018-12-04 11:43:15,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-04 11:43:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:17,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:27,582 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 [2018-12-04 11:43:27,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:27,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:27,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:43:27,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:27,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2018-12-04 11:43:27,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:27,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:43:27,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:43:27,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-04 11:43:27,647 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-12-04 11:43:28,166 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2018-12-04 11:43:32,616 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-12-04 11:43:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:32,632 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-04 11:43:32,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:43:32,632 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-12-04 11:43:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:32,633 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:43:32,633 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:43:32,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2018-12-04 11:43:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:43:32,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:43:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:43:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-04 11:43:32,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-04 11:43:32,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:32,638 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-04 11:43:32,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:43:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-04 11:43:32,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:43:32,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:32,639 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-04 11:43:32,639 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:32,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-12-04 11:43:32,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:32,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:32,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:33,102 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2018-12-04 11:43:33,252 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-12-04 11:43:33,512 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-04 11:43:33,778 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-12-04 11:43:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:33,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:33,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:33,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:33,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:33,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:33,802 INFO L192 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 [2018-12-04 11:43:33,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:33,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:33,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:33,847 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 [2018-12-04 11:43:33,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:33,855 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. [2018-12-04 11:43:33,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:33,885 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 [2018-12-04 11:43:33,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:33,895 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. [2018-12-04 11:43:33,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:43:33,929 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 [2018-12-04 11:43:33,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:33,948 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. [2018-12-04 11:43:33,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-04 11:43:34,119 INFO L303 Elim1Store]: Index analysis took 138 ms [2018-12-04 11:43:34,120 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 [2018-12-04 11:43:34,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,168 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. [2018-12-04 11:43:34,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-04 11:43:34,232 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 [2018-12-04 11:43:34,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,256 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. [2018-12-04 11:43:34,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-04 11:43:34,594 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 [2018-12-04 11:43:34,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,625 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. [2018-12-04 11:43:34,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-04 11:43:36,758 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 [2018-12-04 11:43:36,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:36,806 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. [2018-12-04 11:43:36,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-12-04 11:43:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:50,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:52,394 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 [2018-12-04 11:43:52,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:52,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:52,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-04 11:43:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:43:52,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:52,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2018-12-04 11:43:52,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:52,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:43:52,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:43:52,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=309, Unknown=3, NotChecked=0, Total=420 [2018-12-04 11:43:52,430 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-12-04 11:44:07,737 WARN L180 SmtUtils]: Spent 8.72 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2018-12-04 11:44:21,137 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-12-04 11:44:45,471 WARN L180 SmtUtils]: Spent 9.83 s on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2018-12-04 11:44:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:45,496 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-04 11:44:45,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:44:45,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-12-04 11:44:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:45,497 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:44:45,497 INFO L226 Difference]: Without dead ends: 12 [2018-12-04 11:44:45,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=181, Invalid=512, Unknown=9, NotChecked=0, Total=702 [2018-12-04 11:44:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-04 11:44:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-04 11:44:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:44:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-04 11:44:45,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-04 11:44:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:45,504 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-04 11:44:45,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:44:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-04 11:44:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-04 11:44:45,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:45,505 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-04 11:44:45,505 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:45,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-12-04 11:44:45,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:45,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:45,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:45,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:45,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:46,125 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 30 [2018-12-04 11:44:46,541 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2018-12-04 11:44:47,204 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-12-04 11:44:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:47,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:47,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:47,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:47,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:47,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:47,228 INFO L192 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 [2018-12-04 11:44:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:47,248 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:47,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:44:47,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:47,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:47,288 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 [2018-12-04 11:44:47,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:47,293 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. [2018-12-04 11:44:47,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-04 11:44:47,320 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 [2018-12-04 11:44:47,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:47,329 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. [2018-12-04 11:44:47,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-04 11:44:47,367 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 [2018-12-04 11:44:47,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:47,381 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. [2018-12-04 11:44:47,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-04 11:44:47,432 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 [2018-12-04 11:44:47,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:47,451 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. [2018-12-04 11:44:47,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-04 11:44:47,528 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 [2018-12-04 11:44:47,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:47,556 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. [2018-12-04 11:44:47,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-04 11:44:47,834 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 [2018-12-04 11:44:47,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:47,862 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. [2018-12-04 11:44:47,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-04 11:44:49,020 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-04 11:44:49,221 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 11:44:49,223 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") 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:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) 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:214) 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 [2018-12-04 11:44:49,227 INFO L168 Benchmark]: Toolchain (without parser) took 109183.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -334.6 MB). Peak memory consumption was 472.3 MB. Max. memory is 7.1 GB. [2018-12-04 11:44:49,228 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:44:49,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:44:49,229 INFO L168 Benchmark]: Boogie Preprocessor took 29.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-04 11:44:49,229 INFO L168 Benchmark]: RCFGBuilder took 319.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-04 11:44:49,229 INFO L168 Benchmark]: TraceAbstraction took 108786.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -355.7 MB). Peak memory consumption was 451.2 MB. Max. memory is 7.1 GB. [2018-12-04 11:44:49,232 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 319.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108786.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -355.7 MB). Peak memory consumption was 451.2 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : 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...