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-c78c21b [2018-12-03 15:46:45,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:46:45,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:46:45,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:46:45,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:46:45,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:46:45,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:46:45,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:46:45,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:46:45,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:46:45,833 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:46:45,833 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:46:45,834 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:46:45,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:46:45,836 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:46:45,837 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:46:45,838 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:46:45,840 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:46:45,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:46:45,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:46:45,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:46:45,849 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:46:45,853 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:46:45,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:46:45,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:46:45,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:46:45,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:46:45,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:46:45,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:46:45,866 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:46:45,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:46:45,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:46:45,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:46:45,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:46:45,871 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:46:45,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:46:45,872 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:46:45,899 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:46:45,899 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:46:45,901 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:46:45,901 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:46:45,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:46:45,901 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:46:45,904 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:46:45,904 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:46:45,904 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:46:45,905 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:46:45,905 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:46:45,905 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:46:45,905 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:46:45,906 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:46:45,906 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:46:45,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:46:45,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:46:45,908 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:46:45,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:46:45,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:46:45,910 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:46:45,910 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:46:45,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:46:45,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:46:45,911 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:46:45,911 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:46:45,911 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:46:45,911 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:46:45,911 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:46:45,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:46:45,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:46:45,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:46:45,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:46:45,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:46:45,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:46:45,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:46:45,914 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:46:45,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:46:45,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:46:45,914 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:46:45,915 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:46:45,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:46:45,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:46:45,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:46:45,989 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:46:45,990 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:46:45,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-12-03 15:46:45,991 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-12-03 15:46:46,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:46:46,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:46:46,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:46:46,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:46:46,024 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:46:46,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,059 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:46:46,060 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:46:46,060 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:46:46,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:46:46,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:46:46,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:46:46,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:46:46,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... [2018-12-03 15:46:46,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:46:46,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:46:46,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:46:46,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:46:46,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:46:46,182 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:46:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:46:46,423 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:46:46,424 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:46:46,424 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:46:46 BoogieIcfgContainer [2018-12-03 15:46:46,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:46:46,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:46:46,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:46:46,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:46:46,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:46" (1/2) ... [2018-12-03 15:46:46,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a429e6 and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:46:46, skipping insertion in model container [2018-12-03 15:46:46,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:46:46" (2/2) ... [2018-12-03 15:46:46,435 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-12-03 15:46:46,446 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:46:46,456 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:46:46,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:46:46,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:46:46,515 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:46:46,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:46:46,516 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:46:46,516 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:46:46,516 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:46:46,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:46:46,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:46:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:46:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:46:46,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:46,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:46:46,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:46,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-03 15:46:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:46,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:46,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:46:46,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:46:46,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:46:46,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:46:46,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:46:46,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:46:46,727 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:46:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:46,777 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:46:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:46:46,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:46:46,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:46,791 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:46:46,792 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:46:46,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:46:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:46:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:46:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:46:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:46:46,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:46:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:46,828 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:46:46,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:46:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:46:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:46:46,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:46,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:46:46,829 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:46,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-12-03 15:46:46,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:47,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:47,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:47,142 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:46:47,144 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [7] [2018-12-03 15:46:47,185 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:46:47,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:46:49,692 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:46:49,694 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:46:49,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:49,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:46:49,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:49,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:49,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:49,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:49,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:50,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:46:50,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:50,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:50,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:46:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:50,788 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-03 15:46:50,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:46:50,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:50,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:46:50,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:46:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:50,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-03 15:46:50,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:50,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:46:50,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:46:50,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:46:50,859 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-12-03 15:46:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:50,980 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:46:50,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:46:50,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-12-03 15:46:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:50,981 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:46:50,982 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:46:50,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:46:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:46:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:46:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:46:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:46:50,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:46:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:50,987 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:46:50,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:46:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:46:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:46:50,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:50,988 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:46:50,988 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:50,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-12-03 15:46:50,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:50,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:51,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:51,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:51,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:51,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:51,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:51,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:46:51,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:51,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:51,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:46:51,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:51,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:51,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:46:51,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:46:51,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:51,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:51,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:46:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:51,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:46:51,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:51,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:46:51,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:46:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:46:51,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:51,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 15:46:51,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:51,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:46:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:46:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:46:51,652 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-12-03 15:46:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:51,795 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:46:51,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:46:51,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-03 15:46:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:51,796 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:46:51,796 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:46:51,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:46:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:46:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:46:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:46:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:46:51,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:46:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:51,801 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:46:51,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:46:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:46:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:46:51,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:51,802 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:46:51,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:51,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-12-03 15:46:51,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:51,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:51,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:51,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:52,130 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-12-03 15:46:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:52,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:52,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:52,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:52,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:52,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:52,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:52,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:52,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:52,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:52,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:52,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:46:52,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:52,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:52,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:46:52,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:46:52,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:52,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:52,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:46:52,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-03 15:46:52,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:52,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:52,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-03 15:46:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:52,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:46:52,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:52,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:46:52,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:46:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:46:52,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:52,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 3] total 11 [2018-12-03 15:46:52,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:52,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:46:52,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:46:52,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:46:52,614 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-12-03 15:46:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:52,762 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:46:52,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:46:52,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-12-03 15:46:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:52,764 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:46:52,765 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:46:52,765 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 [2018-12-03 15:46:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:46:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:46:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:46:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:46:52,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:46:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:52,769 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:46:52,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:46:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:46:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:46:52,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:52,770 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:46:52,770 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:52,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-12-03 15:46:52,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:52,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:52,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:53,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:53,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:53,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:53,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:53,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:53,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:53,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:53,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:53,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:53,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:46:53,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:53,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:53,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:46:53,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:46:53,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:53,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:53,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:46:53,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-03 15:46:53,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:53,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:53,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-03 15:46:53,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 15:46:53,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:53,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:53,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-03 15:46:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:53,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:56,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:46:56,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:56,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:46:56,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:46:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 15:46:56,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:56,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 3] total 13 [2018-12-03 15:46:56,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:56,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:46:56,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:46:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=153, Unknown=1, NotChecked=0, Total=210 [2018-12-03 15:46:56,580 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-12-03 15:46:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:56,938 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:46:56,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:46:56,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-12-03 15:46:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:56,939 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:46:56,939 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:46:56,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=82, Invalid=223, Unknown=1, NotChecked=0, Total=306 [2018-12-03 15:46:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:46:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:46:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:46:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:46:56,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:46:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:56,945 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:46:56,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:46:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:46:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:46:56,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:56,946 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:46:56,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:56,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-12-03 15:46:56,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:56,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:56,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:56,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:56,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:57,567 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-12-03 15:46:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:57,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:57,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:57,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:57,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:57,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:57,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:57,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:57,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:57,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:46:57,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:57,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:57,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:46:57,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:57,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:57,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:46:57,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:46:57,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:57,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:57,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:46:57,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-03 15:46:57,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:57,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:57,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-03 15:46:58,058 INFO L303 Elim1Store]: Index analysis took 164 ms [2018-12-03 15:46:58,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 15:46:58,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:58,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:58,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-03 15:46:58,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-03 15:46:58,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:46:58,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-03 15:46:58,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-03 15:46:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:58,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:00,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:47:00,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:00,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:47:00,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:47:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 15:47:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 3] total 15 [2018-12-03 15:47:00,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:00,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:47:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:47:00,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:47:00,796 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-12-03 15:47:01,334 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-03 15:47:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:01,350 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:47:01,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:47:01,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-12-03 15:47:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:01,353 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:47:01,353 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:47:01,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:47:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:47:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:47:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:47:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:47:01,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:47:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:01,358 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:47:01,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:47:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:47:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:47:01,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:01,359 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:47:01,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:01,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-12-03 15:47:01,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:01,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:01,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:01,886 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 29 [2018-12-03 15:47:02,106 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-12-03 15:47:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:02,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:02,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:02,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:02,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:02,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:02,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:02,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:02,143 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:02,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:02,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:02,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:02,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:47:02,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:02,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:02,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:47:02,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:47:02,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:02,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:02,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:47:02,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-03 15:47:02,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:02,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:02,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-03 15:47:02,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 15:47:02,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:02,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:02,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-03 15:47:02,565 INFO L303 Elim1Store]: Index analysis took 135 ms [2018-12-03 15:47:02,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-03 15:47:02,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:02,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:02,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-03 15:47:02,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-03 15:47:02,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:02,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:02,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-03 15:47:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:04,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:11,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:47:11,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:11,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:47:11,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:47:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 15:47:11,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:11,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 3] total 17 [2018-12-03 15:47:11,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:11,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:47:11,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:47:11,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:47:11,212 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-12-03 15:47:16,095 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-12-03 15:47:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:16,110 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:47:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:47:16,111 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-12-03 15:47:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:16,112 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:47:16,112 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:47:16,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=112, Invalid=307, Unknown=1, NotChecked=0, Total=420 [2018-12-03 15:47:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:47:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:47:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:47:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:47:16,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:47:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:16,117 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:47:16,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:47:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:47:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:47:16,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:16,118 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:47:16,118 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:16,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-12-03 15:47:16,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:16,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:16,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:16,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:16,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:16,682 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2018-12-03 15:47:16,925 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-03 15:47:17,202 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-12-03 15:47:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:17,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:17,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:17,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:17,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:17,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:17,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:17,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:17,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:17,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:47:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:17,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:17,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:47:17,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:47:17,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:17,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:17,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:47:17,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-03 15:47:17,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:17,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:17,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-03 15:47:17,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 15:47:17,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:17,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:17,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-03 15:47:17,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-03 15:47:17,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:17,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:17,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-03 15:47:17,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-03 15:47:17,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:17,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:17,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-03 15:47:20,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-03 15:47:20,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:20,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-03 15:47:20,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-12-03 15:47:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:33,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:39,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-03 15:47:39,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:47:39,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:47:39,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-12-03 15:47:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 15:47:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:39,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 3] total 19 [2018-12-03 15:47:39,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:39,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:47:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:47:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=308, Unknown=4, NotChecked=0, Total=420 [2018-12-03 15:47:39,967 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-12-03 15:47:55,358 WARN L180 SmtUtils]: Spent 8.77 s on a formula simplification. DAG size of input: 119 DAG size of output: 48 [2018-12-03 15:48:08,821 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-12-03 15:48:33,362 WARN L180 SmtUtils]: Spent 9.93 s on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2018-12-03 15:48:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:33,387 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:48:33,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:48:33,388 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-12-03 15:48:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:33,389 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:48:33,389 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:48:33,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 65.6s TimeCoverageRelationStatistics Valid=181, Invalid=510, Unknown=11, NotChecked=0, Total=702 [2018-12-03 15:48:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:48:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:48:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:48:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:48:33,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:48:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:33,396 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:48:33,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:48:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:48:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:48:33,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:33,396 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:48:33,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:33,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-12-03 15:48:33,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:33,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:33,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:34,000 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 30 [2018-12-03 15:48:34,350 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 38 [2018-12-03 15:48:34,961 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-12-03 15:48:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:34,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:34,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:34,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:34,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:34,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:34,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:35,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:35,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:35,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:48:35,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:35,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:35,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-03 15:48:35,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:48:35,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 15:48:35,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-03 15:48:35,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-03 15:48:35,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:48:35,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 15:48:35,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-12-03 15:48:35,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-03 15:48:35,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:48:35,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 15:48:35,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-12-03 15:48:35,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-03 15:48:35,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:48:35,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 15:48:35,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-12-03 15:48:35,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-03 15:48:35,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:48:35,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-03 15:48:35,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-12-03 15:48:35,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-03 15:48:35,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:48:35,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-03 15:48:35,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-12-03 15:48:36,758 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-03 15:48:36,959 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:36,960 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-12-03 15:48:36,965 INFO L168 Benchmark]: Toolchain (without parser) took 110943.79 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 828.9 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -195.8 MB). Peak memory consumption was 633.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:48:36,966 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:48:36,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:48:36,967 INFO L168 Benchmark]: Boogie Preprocessor took 27.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:48:36,968 INFO L168 Benchmark]: RCFGBuilder took 333.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:48:36,968 INFO L168 Benchmark]: TraceAbstraction took 110538.11 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 828.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -216.9 MB). Peak memory consumption was 612.0 MB. Max. memory is 7.1 GB. [2018-12-03 15:48:36,971 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.19 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 39.85 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 27.80 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 333.89 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 110538.11 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 828.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -216.9 MB). Peak memory consumption was 612.0 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...