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/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:30:45,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:30:45,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:30:45,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:30:45,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:30:45,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:30:45,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:30:45,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:30:45,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:30:45,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:30:45,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:30:45,798 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:30:45,799 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:30:45,800 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:30:45,801 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:30:45,802 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:30:45,803 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:30:45,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:30:45,807 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:30:45,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:30:45,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:30:45,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:30:45,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:30:45,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:30:45,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:30:45,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:30:45,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:30:45,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:30:45,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:30:45,818 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:30:45,818 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:30:45,818 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:30:45,819 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:30:45,819 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:30:45,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:30:45,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:30:45,821 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 17:30:45,833 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:30:45,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:30:45,834 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:30:45,834 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:30:45,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:30:45,835 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:30:45,835 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:30:45,835 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:30:45,835 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:30:45,835 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:30:45,836 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:30:45,836 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:30:45,836 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:30:45,836 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:30:45,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:30:45,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:30:45,837 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:30:45,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:30:45,838 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:30:45,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:30:45,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:30:45,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:30:45,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:30:45,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:30:45,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:30:45,839 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:30:45,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:30:45,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:30:45,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:30:45,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:30:45,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:30:45,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:30:45,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:30:45,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:30:45,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:30:45,841 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:30:45,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:30:45,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:30:45,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:30:45,842 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:30:45,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:30:45,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:30:45,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:30:45,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:30:45,891 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:30:45,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-01-18 17:30:45,892 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-18 17:30:45,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:30:45,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:30:45,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:30:45,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:30:45,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:30:45,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:45,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:45,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:30:45,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:30:45,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:30:45,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:30:46,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... [2019-01-18 17:30:46,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:30:46,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:30:46,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:30:46,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:30:46,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:30:46,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:30:46,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:30:46,416 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:30:46,416 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-18 17:30:46,417 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:30:46 BoogieIcfgContainer [2019-01-18 17:30:46,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:30:46,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:30:46,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:30:46,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:30:46,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:30:45" (1/2) ... [2019-01-18 17:30:46,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e18f2e1 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:30:46, skipping insertion in model container [2019-01-18 17:30:46,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:30:46" (2/2) ... [2019-01-18 17:30:46,428 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-18 17:30:46,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:30:46,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-18 17:30:46,467 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-18 17:30:46,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:30:46,505 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:30:46,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:30:46,505 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:30:46,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:30:46,505 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:30:46,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:30:46,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:30:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-18 17:30:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 17:30:46,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:46,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 17:30:46,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:46,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-18 17:30:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:46,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:46,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:46,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:30:46,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:30:46,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:30:46,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:30:46,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:30:46,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:30:46,760 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-18 17:30:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:46,983 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-18 17:30:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:30:46,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 17:30:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:46,999 INFO L225 Difference]: With dead ends: 17 [2019-01-18 17:30:47,000 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:30:47,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:30:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:30:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-18 17:30:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:30:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-18 17:30:47,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-18 17:30:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:47,041 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-18 17:30:47,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:30:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-18 17:30:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:30:47,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:47,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:30:47,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:47,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-18 17:30:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:47,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:47,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:30:47,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:30:47,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:30:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:30:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:30:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:30:47,109 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-18 17:30:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:47,204 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 17:30:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:30:47,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:30:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:47,206 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:30:47,206 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:30:47,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:30:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:30:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-18 17:30:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:30:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-18 17:30:47,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-18 17:30:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:47,212 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-18 17:30:47,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:30:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-18 17:30:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:30:47,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:47,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:30:47,213 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-18 17:30:47,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:47,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:47,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:47,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:47,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:30:47,284 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-18 17:30:47,331 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:47,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:47,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:47,397 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:30:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:47,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:47,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:47,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:47,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:47,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:47,476 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:47,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:47,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:47,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:47,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:47,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:47,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:47,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:47,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:47,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:47,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:47,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:47,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:48,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:48,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:30:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:30:48,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:30:48,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:30:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:30:48,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:30:48,085 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-18 17:30:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:48,165 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-18 17:30:48,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:30:48,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 17:30:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:48,166 INFO L225 Difference]: With dead ends: 13 [2019-01-18 17:30:48,166 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:30:48,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:30:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:30:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-18 17:30:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:30:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-18 17:30:48,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-18 17:30:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:48,172 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-18 17:30:48,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:30:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-18 17:30:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:30:48,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:48,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:30:48,174 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-18 17:30:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:48,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:48,343 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-18 17:30:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:48,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:48,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:48,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 17:30:48,351 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-18 17:30:48,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:48,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:48,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:48,362 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:30:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:48,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:48,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:48,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:48,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:48,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:48,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:48,393 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:48,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:48,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:48,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:48,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:48,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:48,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:48,537 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:48,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:48,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:30:48,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:48,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:48,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:48,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:48,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:48,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:30:48,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:48,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:30:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:30:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:30:48,758 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-18 17:30:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:49,293 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-18 17:30:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:30:49,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 17:30:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:49,294 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:30:49,294 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:30:49,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:30:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:30:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-18 17:30:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:30:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-18 17:30:49,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-18 17:30:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:49,298 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-18 17:30:49,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:30:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-18 17:30:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:30:49,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:49,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:30:49,300 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-18 17:30:49,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:49,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:49,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:49,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:30:49,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 17:30:49,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:30:49,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:30:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:30:49,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:30:49,330 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-18 17:30:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:49,362 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-18 17:30:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:30:49,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 17:30:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:49,364 INFO L225 Difference]: With dead ends: 15 [2019-01-18 17:30:49,364 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:30:49,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:30:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:30:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 17:30:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:30:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-18 17:30:49,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-18 17:30:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:49,371 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-18 17:30:49,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:30:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-18 17:30:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:30:49,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:49,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:30:49,372 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-18 17:30:49,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:49,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:49,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:49,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:49,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:49,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:49,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:30:49,460 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-18 17:30:49,465 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:49,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:49,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:49,560 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:30:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:49,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:49,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:49,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:49,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:49,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:49,588 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:49,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:49,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:49,659 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:49,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:49,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:49,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:49,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:49,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:49,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:49,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:30:49,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:49,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:30:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:30:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:30:49,817 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-18 17:30:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:49,994 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-18 17:30:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:30:49,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:30:49,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:49,995 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:30:49,996 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:30:49,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:30:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:30:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-18 17:30:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:30:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-18 17:30:50,002 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-18 17:30:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:50,002 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-18 17:30:50,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:30:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-18 17:30:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:30:50,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:50,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:30:50,003 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:50,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:50,004 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-18 17:30:50,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:50,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:50,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:50,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:50,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:50,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:50,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:50,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:30:50,110 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-18 17:30:50,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:50,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:50,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:50,118 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:50,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:50,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:50,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:50,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:50,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:50,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:50,145 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:50,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:50,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:50,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:50,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:50,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,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. [2019-01-18 17:30:50,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:50,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:30:50,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:50,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:50,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:50,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:50,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:30:50,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:50,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:30:50,480 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-18 17:30:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:50,727 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-18 17:30:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:30:50,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:30:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:50,729 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:30:50,729 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 17:30:50,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:30:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 17:30:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-18 17:30:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:30:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-18 17:30:50,737 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-18 17:30:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:50,738 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-18 17:30:50,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-18 17:30:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:30:50,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:50,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:30:50,739 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:50,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:50,739 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-18 17:30:50,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:50,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:50,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:50,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:50,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:50,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:50,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:30:50,781 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-18 17:30:50,783 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:50,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:50,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:50,789 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:30:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:50,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:50,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:50,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:50,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:50,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:50,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:50,820 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-18 17:30:50,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 17:30:50,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:50,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2019-01-18 17:30:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:50,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 17:30:50,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:50,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:50,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 17:30:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:50,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:30:51,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 17:30:51,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:30:51,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:30:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:30:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:30:51,007 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-18 17:30:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:51,081 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-18 17:30:51,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:30:51,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:30:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:51,082 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:30:51,082 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:30:51,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:30:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:30:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-18 17:30:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:30:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-18 17:30:51,091 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-18 17:30:51,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:51,092 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-18 17:30:51,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:30:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-18 17:30:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:30:51,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:51,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:30:51,093 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:51,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-18 17:30:51,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:51,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:51,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:51,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:51,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:51,201 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:30:51,201 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-18 17:30:51,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:51,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:51,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:51,210 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:51,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:51,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:51,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:51,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:51,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:51,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:51,233 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:51,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:51,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:51,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,323 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:51,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:30:51,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:51,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:51,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 17:30:51,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:51,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:30:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:51,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:30:51,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:51,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:51,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:51,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:30:51,657 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-18 17:30:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:51,826 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2019-01-18 17:30:51,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:30:51,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 17:30:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:51,829 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:30:51,829 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:30:51,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:30:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:30:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-01-18 17:30:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:30:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-18 17:30:51,839 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-18 17:30:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:51,840 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-18 17:30:51,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-18 17:30:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:30:51,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:51,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:30:51,841 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-18 17:30:51,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:51,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:51,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:51,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:30:51,910 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-18 17:30:51,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:51,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:51,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:51,917 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:30:51,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:51,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:51,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:51,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:51,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:51,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:51,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:51,935 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:51,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-18 17:30:51,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:51,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 17:30:51,951 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:51,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:51,991 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-18 17:30:52,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-18 17:30:52,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:52,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:52,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 17:30:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:52,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:52,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:52,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 17:30:52,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:52,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:30:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:30:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:30:52,091 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-18 17:30:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:52,192 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2019-01-18 17:30:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:30:52,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 17:30:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:52,197 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:30:52,197 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:30:52,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:30:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:30:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-01-18 17:30:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:30:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-18 17:30:52,206 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-18 17:30:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:52,207 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-18 17:30:52,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:30:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-18 17:30:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:30:52,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:52,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:30:52,208 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:52,209 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-18 17:30:52,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:52,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:52,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:52,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:52,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:52,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:52,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:52,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:30:52,289 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-18 17:30:52,292 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:52,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:52,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:52,299 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:30:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:52,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:52,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:52,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:52,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:52,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:52,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:52,322 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:52,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:52,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:52,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:52,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:52,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:52,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:52,717 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:52,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:52,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:52,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:52,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:52,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:52,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:52,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 17:30:52,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 17:30:52,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:30:52,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:30:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:30:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:30:52,921 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2019-01-18 17:30:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:52,966 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2019-01-18 17:30:52,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:30:52,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:30:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:52,968 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:30:52,969 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:30:52,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:30:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:30:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-18 17:30:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:30:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2019-01-18 17:30:52,979 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2019-01-18 17:30:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:52,979 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2019-01-18 17:30:52,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:30:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2019-01-18 17:30:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:30:52,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:52,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:30:52,981 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-18 17:30:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:52,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:52,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:30:53,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:53,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:53,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:30:53,103 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-18 17:30:53,105 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:53,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:53,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:53,119 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:53,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:53,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:53,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:53,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:53,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:53,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:53,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:53,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:53,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:53,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:53,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:53,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,361 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:30:53,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-18 17:30:53,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:53,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:53,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:53,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:53,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:30:53,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:53,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:30:53,555 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2019-01-18 17:30:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:53,758 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2019-01-18 17:30:53,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:30:53,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:30:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:53,760 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:30:53,760 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 17:30:53,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:30:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 17:30:53,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-01-18 17:30:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:30:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2019-01-18 17:30:53,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2019-01-18 17:30:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:53,769 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2019-01-18 17:30:53,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2019-01-18 17:30:53,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:30:53,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:53,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:30:53,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-18 17:30:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:53,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:53,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:53,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:53,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:53,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:30:53,852 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-18 17:30:53,854 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:53,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:53,859 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:53,859 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:53,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:53,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:53,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:53,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:53,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:53,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:53,884 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:53,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:53,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:53,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:53,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:53,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:53,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:30:53,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:53,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:53,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:54,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-18 17:30:54,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:54,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:30:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:54,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:54,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:54,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:30:54,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:54,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:54,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:54,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:30:54,108 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2019-01-18 17:30:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:54,444 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-01-18 17:30:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:30:54,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:30:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:54,446 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:30:54,446 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:30:54,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:30:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:30:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-18 17:30:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:30:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-01-18 17:30:54,457 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-01-18 17:30:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:54,457 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-01-18 17:30:54,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-01-18 17:30:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:30:54,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:54,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:30:54,458 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-18 17:30:54,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:54,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:54,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:54,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:54,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:54,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:54,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:30:54,558 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-18 17:30:54,560 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:54,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:54,566 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:54,566 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:54,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:54,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:54,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:54,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:54,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:54,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:54,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:54,598 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-18 17:30:54,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 17:30:54,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:54,670 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-18 17:30:54,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 17:30:54,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-18 17:30:54,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:54,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:30:54,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:54,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:54,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-18 17:30:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:54,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:30:54,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:30:54,790 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2019-01-18 17:30:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:55,240 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2019-01-18 17:30:55,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:30:55,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 17:30:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:55,241 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:30:55,241 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:30:55,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:30:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:30:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-18 17:30:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:30:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2019-01-18 17:30:55,252 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2019-01-18 17:30:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:55,252 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2019-01-18 17:30:55,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2019-01-18 17:30:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:30:55,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:55,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:30:55,254 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:55,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-18 17:30:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:55,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:55,429 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-18 17:30:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:55,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:55,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:55,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 17:30:55,474 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-18 17:30:55,475 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:55,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:55,479 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:55,479 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:30:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:55,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:55,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:55,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:55,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:55,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:55,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:55,496 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:55,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:55,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:55,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:30:55,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:55,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:55,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:30:55,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-18 17:30:55,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:55,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:55,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:55,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:30:55,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:55,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:55,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:55,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:55,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:55,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 17:30:55,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:55,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:30:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:30:55,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:30:55,787 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2019-01-18 17:30:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:56,234 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2019-01-18 17:30:56,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:30:56,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 17:30:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:56,235 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:30:56,235 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:30:56,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:30:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:30:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-01-18 17:30:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:30:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-18 17:30:56,244 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-18 17:30:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:56,245 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-18 17:30:56,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:30:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-18 17:30:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:30:56,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:56,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:30:56,246 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-18 17:30:56,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:56,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:56,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:30:56,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:56,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:56,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:30:56,416 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-18 17:30:56,417 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:56,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:56,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:56,420 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:56,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:56,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:56,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:56,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:56,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:56,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:56,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:56,464 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:56,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:56,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:56,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:56,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:56,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:56,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:56,543 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:56,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:56,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:56,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:56,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:56,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:56,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:30:56,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:56,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:56,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:56,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:56,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:56,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 17:30:56,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:56,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:56,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:30:56,702 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2019-01-18 17:30:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:56,870 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2019-01-18 17:30:56,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:30:56,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:30:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:56,872 INFO L225 Difference]: With dead ends: 29 [2019-01-18 17:30:56,872 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:30:56,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:30:56,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:30:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-18 17:30:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:30:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2019-01-18 17:30:56,883 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2019-01-18 17:30:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:56,884 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2019-01-18 17:30:56,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-01-18 17:30:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:30:56,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:56,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:30:56,885 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:56,885 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-18 17:30:56,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:56,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:56,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:56,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:56,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:30:57,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:57,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:57,038 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:30:57,038 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-18 17:30:57,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:57,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:57,044 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:57,044 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 17:30:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:57,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:57,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:57,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:57,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:57,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:57,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:57,067 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:57,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 17:30:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 17:30:57,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,117 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2019-01-18 17:30:57,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 17:30:57,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:57,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:57,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 17:30:57,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:57,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-18 17:30:57,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,248 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 17:30:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:57,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 17:30:57,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:57,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:57,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-18 17:30:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:57,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:57,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:57,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 17:30:57,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:57,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:30:57,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:30:57,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:30:57,458 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2019-01-18 17:30:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:57,690 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2019-01-18 17:30:57,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:30:57,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:30:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:57,692 INFO L225 Difference]: With dead ends: 27 [2019-01-18 17:30:57,692 INFO L226 Difference]: Without dead ends: 26 [2019-01-18 17:30:57,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:30:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-18 17:30:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2019-01-18 17:30:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:30:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2019-01-18 17:30:57,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2019-01-18 17:30:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:57,699 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2019-01-18 17:30:57,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:30:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2019-01-18 17:30:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:30:57,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:57,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:30:57,700 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2019-01-18 17:30:57,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:57,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:57,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:57,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:57,920 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-18 17:30:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:30:57,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:57,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:57,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:30:57,946 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2019-01-18 17:30:57,946 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:30:57,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:30:57,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:30:57,951 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:30:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:57,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:30:57,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:57,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:30:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:57,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:57,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:57,987 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 17:30:57,992 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-18 17:30:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-18 17:30:58,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:58,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:58,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:58,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:58,031 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2019-01-18 17:30:58,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-18 17:30:58,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:58,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:58,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-18 17:30:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 17:30:58,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-18 17:30:58,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:58,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 17:30:58,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-18 17:30:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:58,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:58,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:58,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 17:30:58,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:58,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:30:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:30:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:30:58,251 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2019-01-18 17:30:58,693 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-18 17:30:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:58,952 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2019-01-18 17:30:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:30:58,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 17:30:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:58,953 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:30:58,954 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 17:30:58,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:30:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 17:30:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 17:30:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 17:30:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 17:30:58,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-18 17:30:58,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:58,956 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 17:30:58,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:30:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 17:30:58,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 17:30:58,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 17:30:59,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 17:30:59,162 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2019-01-18 17:31:00,037 WARN L181 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2019-01-18 17:31:00,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-18 17:31:00,041 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (let ((.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse0 (<= 0 .cse5)) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p2)) (.cse3 (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3)) (.cse4 (= 0 .cse2))) (or (and .cse0 (or (and (<= .cse1 0) (<= 1 .cse2)) (and (<= (+ .cse1 1) 0) .cse3 .cse4))) (and .cse0 (= 0 .cse1) .cse3 .cse4)))) [2019-01-18 17:31:00,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2019-01-18 17:31:00,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-18 17:31:00,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-18 17:31:00,041 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2019-01-18 17:31:00,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-18 17:31:00,042 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-18 17:31:00,042 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-18 17:31:00,051 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 05:31:00 BoogieIcfgContainer [2019-01-18 17:31:00,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 17:31:00,052 INFO L168 Benchmark]: Toolchain (without parser) took 14121.72 ms. Allocated memory was 140.5 MB in the beginning and 338.7 MB in the end (delta: 198.2 MB). Free memory was 106.8 MB in the beginning and 306.1 MB in the end (delta: -199.3 MB). Peak memory consumption was 187.4 MB. Max. memory is 7.1 GB. [2019-01-18 17:31:00,053 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 140.5 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 17:31:00,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.53 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 104.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-01-18 17:31:00,053 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-18 17:31:00,054 INFO L168 Benchmark]: RCFGBuilder took 403.41 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 93.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-01-18 17:31:00,054 INFO L168 Benchmark]: TraceAbstraction took 13632.83 ms. Allocated memory was 140.5 MB in the beginning and 338.7 MB in the end (delta: 198.2 MB). Free memory was 93.2 MB in the beginning and 306.1 MB in the end (delta: -212.9 MB). Peak memory consumption was 173.7 MB. Max. memory is 7.1 GB. [2019-01-18 17:31:00,056 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.17 ms. Allocated memory is still 140.5 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.53 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 104.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.82 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 103.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.41 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 93.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13632.83 ms. Allocated memory was 140.5 MB in the beginning and 338.7 MB in the end (delta: 198.2 MB). Free memory was 93.2 MB in the beginning and 306.1 MB in the end (delta: -212.9 MB). Peak memory consumption was 173.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 <= #memory_int[p3] && ((#memory_int[p3 := #memory_int[p3] + 1][p2] <= 0 && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (((0 <= #memory_int[p3] && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.5s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 127 SDslu, 1 SDs, 0 SdLazy, 1173 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 15 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 100 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 4723 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 168 ConstructedInterpolants, 45 QuantifiedInterpolants, 9722 SizeOfPredicates, 30 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 25/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...