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_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:20,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:20,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:20,906 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:20,906 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:20,907 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:20,909 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:20,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:20,912 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:20,913 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:20,914 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:20,914 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:20,915 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:20,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:20,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:20,918 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:20,919 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:20,921 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:20,923 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:20,925 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:20,926 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:20,927 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:20,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:20,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:20,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:20,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:20,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:20,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:20,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:20,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:20,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:20,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:20,940 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:20,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:20,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:20,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:20,944 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:20,971 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:20,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:20,976 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:20,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:20,977 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:20,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:20,978 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:20,979 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:20,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:20,980 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:20,980 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:20,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:20,981 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:20,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:20,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:20,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:20,981 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:20,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:20,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:20,984 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:20,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:20,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:20,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:20,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:20,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:20,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:20,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:20,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:20,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:20,986 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:20,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:20,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:20,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:20,987 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:21,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:21,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:21,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:21,055 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:21,056 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:21,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-03-04 16:38:21,057 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-03-04 16:38:21,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:21,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:21,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:21,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:21,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,141 WARN L165 Inliner]: Program contained no entry procedure! [2019-03-04 16:38:21,142 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-03-04 16:38:21,142 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-03-04 16:38:21,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:21,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:21,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:21,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... [2019-03-04 16:38:21,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:21,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:21,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:21,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:21,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:21,246 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-03-04 16:38:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-03-04 16:38:21,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-03-04 16:38:21,409 INFO L278 CfgBuilder]: Using library mode [2019-03-04 16:38:21,410 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-03-04 16:38:21,411 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21 BoogieIcfgContainer [2019-03-04 16:38:21,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:21,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:21,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:21,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:21,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:21" (1/2) ... [2019-03-04 16:38:21,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0aed57 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:21, skipping insertion in model container [2019-03-04 16:38:21,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:21" (2/2) ... [2019-03-04 16:38:21,419 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-03-04 16:38:21,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:21,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:38:21,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:38:21,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:21,489 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:21,489 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:21,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:21,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:21,489 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:21,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:21,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-03-04 16:38:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:21,511 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:21,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-03-04 16:38:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:21,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:38:21,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:21,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:21,688 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-03-04 16:38:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:21,741 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-03-04 16:38:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:21,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:38:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:21,755 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:38:21,756 INFO L226 Difference]: Without dead ends: 5 [2019-03-04 16:38:21,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-03-04 16:38:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-03-04 16:38:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-03-04 16:38:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-03-04 16:38:21,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-03-04 16:38:21,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-03-04 16:38:21,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-03-04 16:38:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:21,797 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:21,798 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:21,798 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-03-04 16:38:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:21,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:21,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:21,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:22,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:22,107 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:22,109 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-03-04 16:38:22,169 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:22,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:22,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:22,300 INFO L272 AbstractInterpreter]: Visited 4 different actions 15 times. Merged at 3 different actions 10 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:22,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:22,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:22,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:22,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:22,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:22,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:22,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:22,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:22,524 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:22,633 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:22,635 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:22,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:23,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:38:23,002 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:23,029 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:23,131 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:23,132 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:38:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:23,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-03-04 16:38:23,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:23,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:38:23,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:38:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:23,289 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-03-04 16:38:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:23,383 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-03-04 16:38:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:23,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-03-04 16:38:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:23,385 INFO L225 Difference]: With dead ends: 8 [2019-03-04 16:38:23,385 INFO L226 Difference]: Without dead ends: 6 [2019-03-04 16:38:23,386 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 [2019-03-04 16:38:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-03-04 16:38:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-03-04 16:38:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:38:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-03-04 16:38:23,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-03-04 16:38:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:23,389 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-03-04 16:38:23,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:38:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-03-04 16:38:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:23,390 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:23,390 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-03-04 16:38:23,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-03-04 16:38:23,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:23,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:23,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:23,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:23,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:23,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:23,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:23,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:23,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:23,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:38:23,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:23,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:23,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:23,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:23,788 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:23,844 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:23,845 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:23,929 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:38:23,930 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:23,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:23,944 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:38:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:24,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:24,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:38:24,175 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:24,177 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:24,184 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:24,184 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:38:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:38:24,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:24,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-03-04 16:38:24,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:24,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:24,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:24,214 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-03-04 16:38:24,435 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2019-03-04 16:38:24,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:24,645 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-03-04 16:38:24,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:24,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:24,646 INFO L225 Difference]: With dead ends: 9 [2019-03-04 16:38:24,646 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:38:24,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:38:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-03-04 16:38:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-03-04 16:38:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-03-04 16:38:24,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-03-04 16:38:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:24,650 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-03-04 16:38:24,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-03-04 16:38:24,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:38:24,651 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:24,651 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-03-04 16:38:24,651 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:24,652 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-03-04 16:38:24,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:24,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:24,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:24,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:24,897 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-03-04 16:38:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:24,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:24,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:24,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:24,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:24,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:24,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:24,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:24,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:24,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:38:24,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:24,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:24,980 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:24,991 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:24,991 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:25,034 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:38:25,035 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:25,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:25,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:38:25,114 INFO L453 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:38:25,116 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:25,135 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:25,136 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:38:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:25,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:25,360 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:38:25,360 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:25,364 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:25,383 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:25,383 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:38:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:38:25,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-03-04 16:38:25,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:25,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:38:25,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:38:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:25,414 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-03-04 16:38:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:25,626 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-03-04 16:38:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:25,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:38:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:25,628 INFO L225 Difference]: With dead ends: 10 [2019-03-04 16:38:25,628 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:38:25,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:38:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:38:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-03-04 16:38:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:38:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-03-04 16:38:25,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-03-04 16:38:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:25,633 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-03-04 16:38:25,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:38:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-03-04 16:38:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:38:25,634 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:25,634 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-03-04 16:38:25,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-03-04 16:38:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:25,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:25,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,025 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-03-04 16:38:26,196 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-03-04 16:38:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:26,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:26,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:26,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:26,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:26,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:26,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:26,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:26,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:38:26,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:26,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:26,250 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,260 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:26,260 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:26,322 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:38:26,323 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,332 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:26,333 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:38:26,378 INFO L453 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:38:26,379 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,393 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:26,394 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:38:26,462 INFO L453 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:38:26,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:26,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:26,499 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:38:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:26,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:27,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:38:27,709 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:27,712 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:27,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:27,722 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:38:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-03-04 16:38:27,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:27,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-03-04 16:38:27,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:27,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:38:27,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:38:27,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:38:27,782 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-03-04 16:38:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:28,076 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-03-04 16:38:28,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:28,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:38:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:28,078 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:38:28,078 INFO L226 Difference]: Without dead ends: 9 [2019-03-04 16:38:28,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:38:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-03-04 16:38:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-03-04 16:38:28,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-03-04 16:38:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-03-04 16:38:28,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-03-04 16:38:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:28,083 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-03-04 16:38:28,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:38:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-03-04 16:38:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:38:28,084 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:28,084 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-03-04 16:38:28,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:28,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-03-04 16:38:28,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:28,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:28,573 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-03-04 16:38:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:28,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:28,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:28,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:28,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:28,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:28,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:28,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:28,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:28,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:38:28,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:28,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:38:28,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:28,653 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:28,653 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:28,661 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:28,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:28,701 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:38:28,702 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:28,713 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:28,713 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:38:28,769 INFO L453 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:38:28,770 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:28,786 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:28,787 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:38:28,984 INFO L301 Elim1Store]: Index analysis took 136 ms [2019-03-04 16:38:29,150 INFO L453 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:38:29,151 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:29,172 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:29,173 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:38:29,319 INFO L453 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:29,320 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:29,346 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:29,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:38:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:29,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:31,181 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:38:31,181 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,183 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,189 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:31,189 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:38:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-03-04 16:38:31,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:31,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-03-04 16:38:31,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:31,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-03-04 16:38:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-03-04 16:38:31,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:31,219 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-03-04 16:38:31,884 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-03-04 16:38:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:31,921 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-03-04 16:38:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:38:31,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-03-04 16:38:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:31,925 INFO L225 Difference]: With dead ends: 12 [2019-03-04 16:38:31,925 INFO L226 Difference]: Without dead ends: 10 [2019-03-04 16:38:31,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:38:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-03-04 16:38:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-03-04 16:38:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-03-04 16:38:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-03-04 16:38:31,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-03-04 16:38:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:31,929 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-03-04 16:38:31,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-03-04 16:38:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-03-04 16:38:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:38:31,930 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:31,930 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-03-04 16:38:31,930 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-03-04 16:38:31,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:31,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:31,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:32,430 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-03-04 16:38:32,699 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2019-03-04 16:38:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:32,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:32,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:32,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:32,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:32,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:32,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:32,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:38:32,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:38:32,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:38:32,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:32,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjunts are in the unsatisfiable core [2019-03-04 16:38:32,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:32,792 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:32,793 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,803 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:32,803 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:32,863 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:38:32,864 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,879 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:32,879 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:38:32,946 INFO L453 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:38:32,947 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:32,970 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:32,970 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:38:33,052 INFO L453 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:38:33,054 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:33,071 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:33,072 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:38:33,180 INFO L453 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:33,181 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:33,220 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:33,221 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:38:33,485 INFO L453 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 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:38:33,486 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:33,519 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:33,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-03-04 16:38:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:35,460 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:39,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:38:39,510 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,511 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,518 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:39,519 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:38:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-03-04 16:38:39,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:39,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-03-04 16:38:39,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:39,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-03-04 16:38:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-03-04 16:38:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:38:39,549 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-03-04 16:38:45,042 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-03-04 16:38:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:45,058 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-03-04 16:38:45,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:38:45,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-03-04 16:38:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:45,060 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:38:45,060 INFO L226 Difference]: Without dead ends: 11 [2019-03-04 16:38:45,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-03-04 16:38:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-03-04 16:38:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-03-04 16:38:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:38:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-03-04 16:38:45,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-03-04 16:38:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:45,066 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-03-04 16:38:45,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-03-04 16:38:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-03-04 16:38:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:38:45,067 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:45,067 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-03-04 16:38:45,067 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-03-04 16:38:45,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:45,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:45,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:45,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,754 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-03-04 16:38:46,260 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-03-04 16:38:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:46,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:46,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:46,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:46,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:46,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:46,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:38:46,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:46,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:46,306 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:38:46,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:46,330 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:38:46,331 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,339 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,340 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:38:46,383 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:38:46,384 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,395 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,395 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:38:46,443 INFO L453 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:38:46,444 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,458 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,458 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:38:46,521 INFO L453 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:38:46,522 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,542 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,543 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:38:46,691 INFO L453 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:38:46,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,716 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:38:47,082 INFO L453 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 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:38:47,084 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,118 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:47,118 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-03-04 16:38:49,421 INFO L453 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 6 new quantified variables, introduced 27 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:38:49,422 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,461 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:49,462 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-03-04 16:39:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:03,010 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:07,414 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-03-04 16:39:07,415 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,417 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,424 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-03-04 16:39:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-03-04 16:39:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:07,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-03-04 16:39:07,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:07,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-03-04 16:39:07,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-03-04 16:39:07,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=309, Unknown=3, NotChecked=0, Total=420 [2019-03-04 16:39:07,455 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-03-04 16:39:21,816 WARN L181 SmtUtils]: Spent 8.74 s on a formula simplification. DAG size of input: 97 DAG size of output: 48 [2019-03-04 16:39:53,925 WARN L181 SmtUtils]: Spent 9.88 s on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-03-04 16:39:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:53,948 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-03-04 16:39:53,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:39:53,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-03-04 16:39:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:53,950 INFO L225 Difference]: With dead ends: 14 [2019-03-04 16:39:53,950 INFO L226 Difference]: Without dead ends: 12 [2019-03-04 16:39:53,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=182, Invalid=512, Unknown=8, NotChecked=0, Total=702 [2019-03-04 16:39:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-03-04 16:39:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-03-04 16:39:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:39:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-03-04 16:39:53,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-03-04 16:39:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:53,956 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-03-04 16:39:53,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-03-04 16:39:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-03-04 16:39:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-03-04 16:39:53,957 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:53,957 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-03-04 16:39:53,958 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-03-04 16:39:53,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:54,620 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-03-04 16:39:55,058 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 38 [2019-03-04 16:39:55,444 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 44 [2019-03-04 16:39:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:55,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:55,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:55,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:55,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:55,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:55,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:39:55,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:55,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:55,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-03-04 16:39:55,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:55,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 21 conjunts are in the unsatisfiable core [2019-03-04 16:39:55,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:55,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-03-04 16:39:55,507 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,581 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,581 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-03-04 16:39:55,615 INFO L453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-03-04 16:39:55,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,627 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-03-04 16:39:55,677 INFO L453 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 17 treesize of output 22 [2019-03-04 16:39:55,678 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,693 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,694 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-03-04 16:39:55,764 INFO L453 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 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-03-04 16:39:55,765 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,783 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-03-04 16:39:55,946 INFO L453 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 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:39:55,947 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,972 INFO L309 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,972 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-03-04 16:39:56,237 INFO L453 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 5 new quantified variables, introduced 20 case distinctions, treesize of input 32 treesize of output 46 [2019-03-04 16:39:56,238 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:56,273 INFO L309 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:56,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-03-04 16:39:59,793 INFO L453 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 6 new quantified variables, introduced 27 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:39:59,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,847 INFO L309 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:59,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-03-04 16:40:11,607 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 35 case distinctions, treesize of input 42 treesize of output 62 [2019-03-04 16:40:11,609 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,653 INFO L309 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:11,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2019-03-04 16:40:14,677 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:40:14,878 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:14,880 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:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) 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:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-03-04 16:40:14,885 INFO L168 Benchmark]: Toolchain (without parser) took 113785.25 ms. Allocated memory was 140.0 MB in the beginning and 356.5 MB in the end (delta: 216.5 MB). Free memory was 107.5 MB in the beginning and 316.0 MB in the end (delta: -208.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:40:14,886 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 108.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:40:14,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.23 ms. Allocated memory is still 140.0 MB. Free memory was 107.5 MB in the beginning and 105.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-03-04 16:40:14,886 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.6 MB in the end (delta: 969.4 kB). Peak memory consumption was 969.4 kB. Max. memory is 7.1 GB. [2019-03-04 16:40:14,887 INFO L168 Benchmark]: RCFGBuilder took 235.96 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 95.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. [2019-03-04 16:40:14,887 INFO L168 Benchmark]: TraceAbstraction took 113472.07 ms. Allocated memory was 140.0 MB in the beginning and 356.5 MB in the end (delta: 216.5 MB). Free memory was 95.6 MB in the beginning and 316.0 MB in the end (delta: -220.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:40:14,890 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 140.0 MB. Free memory is still 108.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.23 ms. Allocated memory is still 140.0 MB. Free memory was 107.5 MB in the beginning and 105.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.18 ms. Allocated memory is still 140.0 MB. Free memory was 105.6 MB in the beginning and 104.6 MB in the end (delta: 969.4 kB). Peak memory consumption was 969.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 235.96 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 95.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 113472.07 ms. Allocated memory was 140.0 MB in the beginning and 356.5 MB in the end (delta: 216.5 MB). Free memory was 95.6 MB in the beginning and 316.0 MB in the end (delta: -220.4 MB). There was no memory consumed. 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...