java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:29:08,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:29:08,205 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:29:08,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:29:08,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:29:08,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:29:08,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:29:08,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:29:08,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:29:08,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:29:08,233 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:29:08,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:29:08,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:29:08,238 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:29:08,239 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:29:08,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:29:08,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:29:08,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:29:08,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:29:08,250 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:29:08,252 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:29:08,255 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:29:08,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:29:08,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:29:08,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:29:08,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:29:08,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:29:08,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:29:08,262 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:29:08,263 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:29:08,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:29:08,264 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:29:08,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:29:08,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:29:08,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:29:08,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:29:08,267 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 21:29:08,284 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:29:08,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:29:08,286 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:29:08,287 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:29:08,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:29:08,287 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:29:08,287 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:29:08,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:29:08,288 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:29:08,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:29:08,288 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:29:08,289 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:29:08,289 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:29:08,289 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:29:08,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:29:08,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:29:08,290 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:29:08,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:29:08,290 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:29:08,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:29:08,293 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:29:08,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:29:08,294 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:29:08,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:29:08,294 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:29:08,294 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:29:08,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:29:08,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:29:08,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:29:08,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:29:08,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:29:08,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:29:08,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:29:08,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:29:08,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:29:08,296 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:29:08,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:29:08,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:29:08,297 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:29:08,297 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:29:08,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:29:08,352 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:29:08,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:29:08,358 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:29:08,359 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:29:08,359 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2019-01-07 21:29:08,360 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2019-01-07 21:29:08,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:29:08,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:29:08,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:08,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:29:08,395 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:29:08,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,433 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 21:29:08,433 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 21:29:08,434 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 21:29:08,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:08,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:29:08,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:29:08,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:29:08,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/1) ... [2019-01-07 21:29:08,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:29:08,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:29:08,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:29:08,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:29:08,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (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-01-07 21:29:08,545 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-01-07 21:29:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 21:29:08,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 21:29:08,756 INFO L278 CfgBuilder]: Using library mode [2019-01-07 21:29:08,756 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-07 21:29:08,757 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:08 BoogieIcfgContainer [2019-01-07 21:29:08,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:29:08,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:29:08,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:29:08,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:29:08,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:08" (1/2) ... [2019-01-07 21:29:08,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d38b20 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:29:08, skipping insertion in model container [2019-01-07 21:29:08,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:08" (2/2) ... [2019-01-07 21:29:08,767 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2019-01-07 21:29:08,778 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:29:08,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 21:29:08,808 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 21:29:08,852 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:29:08,853 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:29:08,853 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:29:08,853 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:29:08,853 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:29:08,854 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:29:08,854 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:29:08,854 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:29:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 21:29:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:29:08,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:08,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:29:08,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-01-07 21:29:08,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:08,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:08,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:09,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:09,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:29:09,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:09,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:29:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:29:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:09,123 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 21:29:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:09,165 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 21:29:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:29:09,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 21:29:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:09,183 INFO L225 Difference]: With dead ends: 11 [2019-01-07 21:29:09,184 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 21:29:09,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 21:29:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 21:29:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 21:29:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 21:29:09,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 21:29:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:09,222 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 21:29:09,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:29:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 21:29:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:29:09,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:09,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:29:09,223 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:09,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-01-07 21:29:09,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:09,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:09,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:09,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:09,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:09,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:29:09,549 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [7] [2019-01-07 21:29:09,585 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:29:09,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:29:09,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:29:09,741 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:29:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:09,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:29:09,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:09,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:09,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:09,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:09,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:09,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:09,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:10,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:10,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:10,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:10,476 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-07 21:29:10,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:29:10,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:10,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:10,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:29:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:10,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:10,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-01-07 21:29:10,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:10,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:29:10,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:29:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:29:10,665 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2019-01-07 21:29:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:10,744 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 21:29:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:29:10,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-07 21:29:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:10,745 INFO L225 Difference]: With dead ends: 8 [2019-01-07 21:29:10,745 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 21:29:10,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:29:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 21:29:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 21:29:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 21:29:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-07 21:29:10,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-07 21:29:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:10,750 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-07 21:29:10,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:29:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 21:29:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:29:10,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:10,751 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 21:29:10,751 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-01-07 21:29:10,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:10,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:10,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:10,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:11,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:11,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:11,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:11,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:11,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:11,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:11,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:29:11,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:11,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:11,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:11,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:11,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:11,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:11,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:29:11,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:11,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:11,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:29:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:11,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:11,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:29:11,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:11,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:11,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:29:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:29:11,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:11,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2019-01-07 21:29:11,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:11,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:29:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:29:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:29:11,834 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2019-01-07 21:29:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:12,130 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 21:29:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:29:12,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:29:12,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:12,131 INFO L225 Difference]: With dead ends: 9 [2019-01-07 21:29:12,131 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 21:29:12,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:29:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 21:29:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 21:29:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 21:29:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-07 21:29:12,134 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-07 21:29:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:12,135 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-07 21:29:12,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:29:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 21:29:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:29:12,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:12,136 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-07 21:29:12,136 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:12,136 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-01-07 21:29:12,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:12,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:12,461 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-01-07 21:29:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:12,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:12,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:12,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:12,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:12,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:12,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:12,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:12,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:12,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:12,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:12,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:12,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:12,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:12,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:12,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:29:12,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:12,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:12,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:29:12,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-07 21:29:12,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:12,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:12,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 21:29:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:12,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:13,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:29:13,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:13,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:13,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:29:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:29:13,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:13,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2019-01-07 21:29:13,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:29:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:29:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:29:13,094 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2019-01-07 21:29:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:13,316 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-07 21:29:13,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:29:13,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:29:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:13,318 INFO L225 Difference]: With dead ends: 10 [2019-01-07 21:29:13,318 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 21:29:13,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:29:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 21:29:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 21:29:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 21:29:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-07 21:29:13,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-07 21:29:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:13,323 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-07 21:29:13,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:29:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 21:29:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:29:13,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:13,324 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-07 21:29:13,324 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-01-07 21:29:13,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,749 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 19 [2019-01-07 21:29:13,928 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2019-01-07 21:29:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:14,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:14,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:14,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:14,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:14,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:14,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:14,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:14,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:14,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:14,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:29:14,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:14,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:29:14,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-07 21:29:14,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:14,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 21:29:14,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-07 21:29:14,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:14,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 21:29:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:14,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:29:14,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:14,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:29:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 21:29:14,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:14,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2019-01-07 21:29:14,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:14,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:29:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:29:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:29:14,760 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2019-01-07 21:29:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:15,059 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 21:29:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:29:15,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-07 21:29:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:15,060 INFO L225 Difference]: With dead ends: 11 [2019-01-07 21:29:15,060 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 21:29:15,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:29:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 21:29:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 21:29:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 21:29:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-07 21:29:15,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-07 21:29:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:15,065 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-07 21:29:15,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:29:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-07 21:29:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:29:15,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:15,066 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-07 21:29:15,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:15,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-01-07 21:29:15,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:15,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:15,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:15,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:15,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:15,604 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2019-01-07 21:29:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:15,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:15,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:15,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:15,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:15,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:15,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:29:15,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:15,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:15,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:15,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:15,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:15,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:15,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:29:15,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:15,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:15,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:29:15,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-07 21:29:15,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:15,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:15,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 21:29:16,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-07 21:29:16,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:16,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:16,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 21:29:16,332 INFO L303 Elim1Store]: Index analysis took 257 ms [2019-01-07 21:29:16,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-07 21:29:16,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:16,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:16,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 21:29:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:16,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:23,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:29:23,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:23,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:23,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:29:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 21:29:23,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:23,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2019-01-07 21:29:23,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:23,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 21:29:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 21:29:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:29:23,292 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2019-01-07 21:29:24,088 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-01-07 21:29:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:24,103 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 21:29:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:29:24,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2019-01-07 21:29:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:24,105 INFO L225 Difference]: With dead ends: 12 [2019-01-07 21:29:24,105 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 21:29:24,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:29:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 21:29:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-07 21:29:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 21:29:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-07 21:29:24,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-07 21:29:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:24,110 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-07 21:29:24,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 21:29:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-07 21:29:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:29:24,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:24,111 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-07 21:29:24,112 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-01-07 21:29:24,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:24,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:24,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:24,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:24,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:24,635 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2019-01-07 21:29:24,852 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2019-01-07 21:29:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:24,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:24,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:24,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:24,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:24,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:24,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:24,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:24,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:24,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:24,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:24,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:24,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:24,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:24,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:24,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:24,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:29:24,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:24,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:24,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:29:25,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-07 21:29:25,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:25,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:25,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 21:29:25,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-07 21:29:25,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:25,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:25,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 21:29:25,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-07 21:29:25,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:25,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:25,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 21:29:25,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-07 21:29:25,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:25,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:25,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-07 21:29:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:27,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:29,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:29:29,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:29,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:29,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:29:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-07 21:29:29,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:29,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2019-01-07 21:29:29,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:29,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 21:29:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 21:29:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:29:29,523 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2019-01-07 21:29:30,017 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 29 [2019-01-07 21:29:34,591 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-01-07 21:29:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:34,605 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-07 21:29:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:29:34,605 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2019-01-07 21:29:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:34,606 INFO L225 Difference]: With dead ends: 13 [2019-01-07 21:29:34,606 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 21:29:34,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2019-01-07 21:29:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 21:29:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 21:29:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 21:29:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-07 21:29:34,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-07 21:29:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:34,613 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-07 21:29:34,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 21:29:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 21:29:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:29:34,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:34,614 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-07 21:29:34,614 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:29:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-01-07 21:29:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:34,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:34,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:34,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:35,155 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2019-01-07 21:29:35,301 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-01-07 21:29:35,578 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-07 21:29:35,877 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2019-01-07 21:29:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:35,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:35,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:35,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:35,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:35,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:35,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:35,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:35,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:35,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:29:35,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:35,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:35,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:29:35,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:29:35,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:35,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:35,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:29:36,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-07 21:29:36,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:36,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:36,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 21:29:36,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-07 21:29:36,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:36,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:36,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 21:29:36,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-07 21:29:36,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:36,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:36,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 21:29:36,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-07 21:29:36,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:36,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:36,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-07 21:29:38,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-07 21:29:38,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:38,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-07 21:29:38,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2019-01-07 21:29:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:52,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:02,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-01-07 21:30:02,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:02,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:02,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-07 21:30:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 21:30:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:02,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2019-01-07 21:30:02,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 21:30:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 21:30:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=309, Unknown=3, NotChecked=0, Total=420 [2019-01-07 21:30:02,200 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2019-01-07 21:30:18,000 WARN L181 SmtUtils]: Spent 8.77 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2019-01-07 21:30:31,418 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2019-01-07 21:30:55,911 WARN L181 SmtUtils]: Spent 9.89 s on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-01-07 21:30:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:55,933 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-07 21:30:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:30:55,933 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2019-01-07 21:30:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:55,934 INFO L225 Difference]: With dead ends: 14 [2019-01-07 21:30:55,934 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 21:30:55,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 69.5s TimeCoverageRelationStatistics Valid=181, Invalid=510, Unknown=11, NotChecked=0, Total=702 [2019-01-07 21:30:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 21:30:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 21:30:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 21:30:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-07 21:30:55,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-07 21:30:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:55,940 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-07 21:30:55,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-07 21:30:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 21:30:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 21:30:55,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:55,941 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-07 21:30:55,941 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:30:55,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-01-07 21:30:55,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:55,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:55,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:55,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:56,635 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 30 [2019-01-07 21:30:57,054 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2019-01-07 21:30:57,685 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2019-01-07 21:30:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:57,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:57,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:57,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:57,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:57,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:57,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:57,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:57,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:57,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-07 21:30:57,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:57,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:57,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 21:30:57,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:57,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:30:57,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 21:30:57,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-07 21:30:57,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:57,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:30:57,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-01-07 21:30:57,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-07 21:30:57,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:57,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:30:57,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-01-07 21:30:57,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-07 21:30:57,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:57,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:30:57,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2019-01-07 21:30:58,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-07 21:30:58,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:58,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 21:30:58,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2019-01-07 21:30:58,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-07 21:30:58,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:58,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 21:30:58,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2019-01-07 21:30:59,492 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 21:30:59,693 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:30:59,695 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:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-07 21:30:59,700 INFO L168 Benchmark]: Toolchain (without parser) took 111306.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -273.6 MB). Peak memory consumption was 540.7 MB. Max. memory is 7.1 GB. [2019-01-07 21:30:59,701 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:30:59,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:30:59,702 INFO L168 Benchmark]: Boogie Preprocessor took 35.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:30:59,702 INFO L168 Benchmark]: RCFGBuilder took 284.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:30:59,703 INFO L168 Benchmark]: TraceAbstraction took 110940.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -294.7 MB). Peak memory consumption was 519.5 MB. Max. memory is 7.1 GB. [2019-01-07 21:30:59,705 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 284.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 110940.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 814.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -294.7 MB). Peak memory consumption was 519.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...