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-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:37:46,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:37:46,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:37:46,850 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:37:46,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:37:46,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:37:46,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:37:46,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:37:46,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:37:46,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:37:46,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:37:46,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:37:46,859 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:37:46,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:37:46,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:37:46,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:37:46,863 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:37:46,865 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:37:46,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:37:46,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:37:46,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:37:46,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:37:46,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:37:46,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:37:46,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:37:46,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:37:46,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:37:46,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:37:46,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:37:46,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:37:46,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:37:46,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:37:46,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:37:46,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:37:46,881 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:37:46,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:37:46,883 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-02-18 09:37:46,900 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:37:46,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:37:46,901 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:37:46,902 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:37:46,902 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:37:46,902 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:37:46,902 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:37:46,902 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:37:46,903 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:37:46,903 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:37:46,903 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:37:46,903 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:37:46,903 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:37:46,904 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:37:46,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:37:46,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:37:46,905 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:37:46,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:37:46,905 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:37:46,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:37:46,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:37:46,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:37:46,906 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:37:46,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:37:46,906 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:37:46,906 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:37:46,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:37:46,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:37:46,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:37:46,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:37:46,907 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:37:46,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:37:46,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:37:46,908 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:37:46,908 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:37:46,908 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:37:46,909 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:37:46,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:37:46,909 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:37:46,909 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:37:46,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:37:46,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:37:46,957 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:37:46,959 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:37:46,959 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:37:46,960 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-02-18 09:37:46,960 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-02-18 09:37:47,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:37:47,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:37:47,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:37:47,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:37:47,007 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:37:47,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:37:47,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:37:47,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:37:47,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:37:47,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... [2019-02-18 09:37:47,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:37:47,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:37:47,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:37:47,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:37:47,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:37:47,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:37:47,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:37:47,427 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:37:47,428 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-18 09:37:47,429 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:37:47 BoogieIcfgContainer [2019-02-18 09:37:47,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:37:47,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:37:47,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:37:47,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:37:47,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:37:46" (1/2) ... [2019-02-18 09:37:47,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef717ae and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:37:47, skipping insertion in model container [2019-02-18 09:37:47,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:37:47" (2/2) ... [2019-02-18 09:37:47,441 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-02-18 09:37:47,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:37:47,462 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-18 09:37:47,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-18 09:37:47,516 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:37:47,517 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:37:47,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:37:47,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:37:47,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:37:47,517 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:37:47,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:37:47,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:37:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-18 09:37:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:37:47,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:47,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:37:47,549 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:47,557 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-18 09:37:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:47,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:47,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:47,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:47,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:47,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:37:47,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:37:47,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:47,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:37:47,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:37:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:37:47,757 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-18 09:37:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:47,972 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-18 09:37:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:37:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:47,987 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:37:47,988 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:37:47,991 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-02-18 09:37:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:37:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-18 09:37:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:37:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-18 09:37:48,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-18 09:37:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:48,029 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-18 09:37:48,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:37:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-18 09:37:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:37:48,030 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:48,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:37:48,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:48,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:48,031 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-18 09:37:48,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:48,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:48,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:48,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:48,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:48,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:37:48,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:37:48,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:48,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:37:48,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:37:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:37:48,088 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-18 09:37:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:48,178 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-18 09:37:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:48,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:37:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:48,180 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:37:48,180 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:37:48,181 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-02-18 09:37:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:37:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-18 09:37:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:37:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-18 09:37:48,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-18 09:37:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:48,185 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-18 09:37:48,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:37:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-18 09:37:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:37:48,186 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:48,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:37:48,187 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:48,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-18 09:37:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:48,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:48,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:48,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:48,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:48,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:37:48,282 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-18 09:37:48,321 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:48,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:48,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:48,417 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:37:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:48,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:48,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:48,424 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-02-18 09:37:48,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:48,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:48,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:48,647 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-18 09:37:48,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:48,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:48,834 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-18 09:37:48,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:48,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:48,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:48,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:48,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-18 09:37:49,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 09:37:49,054 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-02-18 09:37:49,055 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,140 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:49,189 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:49,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:49,233 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-02-18 09:37:49,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,262 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-02-18 09:37:49,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:49,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:49,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:37:49,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:37:49,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:49,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:37:49,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:37:49,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:37:49,391 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-02-18 09:37:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:49,489 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-02-18 09:37:49,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:37:49,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:37:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:49,490 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:37:49,490 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:37:49,491 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-02-18 09:37:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:37:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-02-18 09:37:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:37:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-02-18 09:37:49,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-02-18 09:37:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:49,495 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-02-18 09:37:49,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:37:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-02-18 09:37:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:37:49,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:49,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:37:49,496 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:49,497 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-18 09:37:49,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:49,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:49,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:49,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:49,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:49,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:49,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:37:49,552 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-18 09:37:49,554 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:49,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:49,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:49,560 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:37:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:49,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:49,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37: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 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-02-18 09:37:49,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:49,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:49,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:49,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:49,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:49,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:49,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-18 09:37:49,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 09:37:49,749 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-02-18 09:37:49,750 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:49,835 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:49,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:49,962 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-02-18 09:37:49,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:50,158 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-02-18 09:37:50,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:50,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:50,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:50,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:37:50,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:50,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:37:50,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:37:50,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:50,273 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-02-18 09:37:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:50,568 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-02-18 09:37:50,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:37:50,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:37:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:50,570 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:37:50,570 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:37:50,570 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-02-18 09:37:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:37:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-02-18 09:37:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:37:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-02-18 09:37:50,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-02-18 09:37:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:50,577 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-02-18 09:37:50,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:37:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-02-18 09:37:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:50,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:50,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:50,579 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:50,580 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-02-18 09:37:50,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:50,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:50,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:50,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:50,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:37:50,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:37:50,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:50,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:37:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:37:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:37:50,619 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-02-18 09:37:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:50,654 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-02-18 09:37:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:50,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:37:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:50,655 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:37:50,655 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:37:50,656 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-02-18 09:37:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:37:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-18 09:37:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:37:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-02-18 09:37:50,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-02-18 09:37:50,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:50,661 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-02-18 09:37:50,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:37:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-18 09:37:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:50,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:50,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:50,662 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:50,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-02-18 09:37:50,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:50,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:50,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:50,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:50,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:50,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:50,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:50,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:50,740 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-02-18 09:37:50,741 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:50,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:50,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:50,801 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:37:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:50,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:50,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:50,802 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-02-18 09:37:50,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:50,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:50,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:50,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-18 09:37:50,855 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-02-18 09:37:50,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:50,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:50,863 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-02-18 09:37:50,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:50,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:50,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:50,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:50,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:50,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:50,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:50,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:50,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:50,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:50,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:50,989 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:51,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,026 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-02-18 09:37:51,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,072 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-02-18 09:37:51,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:51,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:51,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:51,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:37:51,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:51,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:37:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:37:51,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:51,150 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-02-18 09:37:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:51,298 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-02-18 09:37:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:37:51,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:37:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:51,299 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:37:51,300 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:37:51,300 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-02-18 09:37:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:37:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-02-18 09:37:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:37:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-02-18 09:37:51,305 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-02-18 09:37:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:51,305 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-02-18 09:37:51,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:37:51,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-02-18 09:37:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:51,306 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:51,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:51,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-18 09:37:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:51,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:51,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:51,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:51,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:51,373 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-18 09:37:51,375 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:51,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:51,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:51,380 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:37:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:51,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:51,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:51,381 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-02-18 09:37:51,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:51,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:51,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:51,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:51,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:51,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-18 09:37:51,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 09:37:51,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-02-18 09:37:51,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:51,561 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:51,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,583 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-02-18 09:37:51,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,606 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-02-18 09:37:51,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:51,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:51,689 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-02-18 09:37:51,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:51,718 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-02-18 09:37:51,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-18 09:37:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:51,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:51,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:51,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:51,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:51,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:51,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:51,803 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-02-18 09:37:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:52,035 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-02-18 09:37:52,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:52,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:37:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:52,036 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:37:52,036 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:37:52,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-02-18 09:37:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:37:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-02-18 09:37:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:37:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-02-18 09:37:52,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-02-18 09:37:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:52,044 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-02-18 09:37:52,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-02-18 09:37:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:52,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:52,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:52,045 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-02-18 09:37:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:52,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:52,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:52,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:52,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:52,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:52,084 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:52,085 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-02-18 09:37:52,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:52,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:52,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:52,093 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:37:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:52,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:52,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:52,094 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-02-18 09:37:52,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:52,105 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:52,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:52,116 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-02-18 09:37:52,122 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-02-18 09:37:52,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-18 09:37:52,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,155 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-02-18 09:37:52,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-02-18 09:37:52,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,167 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 09:37:52,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 09:37:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:52,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:52,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:37:52,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-18 09:37:52,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:52,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:37:52,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:37:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:37:52,221 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-02-18 09:37:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:52,278 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-02-18 09:37:52,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:37:52,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:37:52,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:52,279 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:37:52,280 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:37:52,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:37:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:37:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-02-18 09:37:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:37:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-02-18 09:37:52,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-02-18 09:37:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:52,288 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-02-18 09:37:52,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:37:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-02-18 09:37:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:52,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:52,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:52,290 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-18 09:37:52,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:52,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:52,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:52,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:52,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:52,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:52,396 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-18 09:37:52,397 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:52,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:52,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:52,401 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:37:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:52,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:52,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:52,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 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-02-18 09:37:52,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:52,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:52,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:52,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-18 09:37:52,464 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-02-18 09:37:52,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,486 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-02-18 09:37:52,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:52,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:52,612 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,630 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:52,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,650 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-02-18 09:37:52,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,663 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-02-18 09:37:52,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:52,690 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-02-18 09:37:52,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:52,712 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-02-18 09:37:52,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-18 09:37:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:52,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:52,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:52,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:37:52,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:52,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:52,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:52,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:37:52,810 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-02-18 09:37:53,080 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-18 09:37:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:53,174 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-02-18 09:37:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:53,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:37:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:53,176 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:37:53,176 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:37:53,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:37:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:37:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-02-18 09:37:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:37:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-18 09:37:53,187 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-18 09:37:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:53,187 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-18 09:37:53,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-18 09:37:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:37:53,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:53,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:37:53,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-02-18 09:37:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:53,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:53,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:53,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:53,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:53,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:37:53,229 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-02-18 09:37:53,230 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:53,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:53,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:53,234 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:37:53,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:53,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:53,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:53,235 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-02-18 09:37:53,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:53,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:53,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:53,264 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 11 treesize of output 14 [2019-02-18 09:37:53,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:53,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:53,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-02-18 09:37:53,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:53,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:53,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-18 09:37:53,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-18 09:37:53,310 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 17 treesize of output 24 [2019-02-18 09:37:53,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:53,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:53,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:53,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:53,342 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-18 09:37:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:53,404 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-02-18 09:37:53,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:53,411 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-02-18 09:37:53,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-18 09:37:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:53,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:53,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:53,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:37:53,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:53,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:37:53,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:37:53,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:53,721 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-02-18 09:37:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:53,905 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-02-18 09:37:53,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:37:53,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:37:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:53,906 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:37:53,906 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:37:53,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:37:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:37:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-02-18 09:37:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:37:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-02-18 09:37:53,915 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-02-18 09:37:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:53,915 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-02-18 09:37:53,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:37:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-02-18 09:37:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:53,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:53,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:53,916 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-02-18 09:37:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:53,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:54,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:54,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:54,049 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:54,049 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-02-18 09:37:54,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:54,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:54,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:54,056 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:37:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:54,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:54,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:54,057 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-02-18 09:37:54,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:54,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:54,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:54,075 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-02-18 09:37:54,116 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-02-18 09:37:54,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,200 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 17 treesize of output 24 [2019-02-18 09:37:54,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,358 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 11 treesize of output 14 [2019-02-18 09:37:54,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-02-18 09:37:54,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,379 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:54,389 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-18 09:37:54,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02-18 09:37:54,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,436 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-02-18 09:37:54,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-18 09:37:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:54,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:54,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:37:54,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-02-18 09:37:54,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:37:54,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:37:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:37:54,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:54,480 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-02-18 09:37:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:54,517 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-02-18 09:37:54,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:37:54,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:37:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:54,519 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:37:54,519 INFO L226 Difference]: Without dead ends: 36 [2019-02-18 09:37:54,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:37:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-18 09:37:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-02-18 09:37:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:37:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-02-18 09:37:54,530 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-02-18 09:37:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:54,530 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-02-18 09:37:54,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:37:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-02-18 09:37:54,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:54,531 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:54,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:54,532 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:54,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:54,532 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-02-18 09:37:54,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:54,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:54,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:54,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:54,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:37:54,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:54,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:54,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:54,618 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-02-18 09:37:54,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:54,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:54,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:54,628 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:37:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:54,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:54,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:54,629 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-02-18 09:37:54,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:54,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:54,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:54,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-18 09:37:54,681 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-02-18 09:37:54,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,708 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-02-18 09:37:54,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:54,765 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,792 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,817 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-02-18 09:37:54,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,826 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-02-18 09:37:54,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:54,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:54,848 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:54,849 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-02-18 09:37:54,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:54,862 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-02-18 09:37:54,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-18 09:37:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:54,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:54,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:37:54,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:54,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:37:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:37:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:37:54,915 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-02-18 09:37:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:55,166 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-02-18 09:37:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:37:55,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-18 09:37:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:55,168 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:37:55,168 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:37:55,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:37:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:37:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-02-18 09:37:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:37:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-02-18 09:37:55,176 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-02-18 09:37:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:55,176 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-02-18 09:37:55,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:37:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-02-18 09:37:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:55,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:55,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:55,178 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:55,178 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-02-18 09:37:55,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:55,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:55,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:55,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:55,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:55,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:55,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:55,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:55,255 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-02-18 09:37:55,256 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:55,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:55,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:55,260 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:37:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:55,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:55,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:55,261 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-02-18 09:37:55,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:55,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:55,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:55,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:37:55,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-18 09:37:55,311 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-02-18 09:37:55,315 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-02-18 09:37:55,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:55,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-02-18 09:37:55,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,359 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-02-18 09:37:55,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 09:37:55,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,400 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-02-18 09:37:55,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:55,411 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-02-18 09:37:55,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-18 09:37:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:55,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:55,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:55,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:55,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:55,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:55,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:55,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:55,505 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-02-18 09:37:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:55,825 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-02-18 09:37:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:55,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:37:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:55,825 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:37:55,826 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:37:55,826 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-02-18 09:37:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:37:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-18 09:37:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:37:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-02-18 09:37:55,842 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-02-18 09:37:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:55,842 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-02-18 09:37:55,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-02-18 09:37:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:55,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:55,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:55,843 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-02-18 09:37:55,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:55,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:55,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:55,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:55,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:55,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:55,954 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-02-18 09:37:55,955 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:55,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:55,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:55,958 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:37:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:55,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:55,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:55,959 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-02-18 09:37:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:55,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:55,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:55,976 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-02-18 09:37:55,979 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-02-18 09:37:55,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:55,991 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 17 treesize of output 24 [2019-02-18 09:37:55,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,027 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 11 treesize of output 14 [2019-02-18 09:37:56,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-02-18 09:37:56,038 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,042 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:56,060 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-18 09:37:56,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,081 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-02-18 09:37:56,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 09:37:56,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,148 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-02-18 09:37:56,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,154 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-02-18 09:37:56,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-18 09:37:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:56,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:56,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:56,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:37:56,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:56,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:37:56,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:37:56,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:37:56,207 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-02-18 09:37:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:56,362 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-02-18 09:37:56,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:37:56,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:37:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:56,364 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:37:56,364 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:37:56,364 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-02-18 09:37:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:37:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-02-18 09:37:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-18 09:37:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-02-18 09:37:56,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-02-18 09:37:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:56,376 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-02-18 09:37:56,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:37:56,376 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-02-18 09:37:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:37:56,377 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:56,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:37:56,377 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-02-18 09:37:56,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:56,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:56,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:56,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:56,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:37:56,560 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-18 09:37:56,563 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:56,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:56,567 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:56,567 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:37:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:56,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:56,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:56,568 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-02-18 09:37:56,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:56,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:56,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:56,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:56,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:56,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-18 09:37:56,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 09:37:56,676 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-02-18 09:37:56,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,702 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:56,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,722 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-02-18 09:37:56,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,734 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-02-18 09:37:56,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,753 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:56,754 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-02-18 09:37:56,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:37:56,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-02-18 09:37:56,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:56,801 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-02-18 09:37:56,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:56,815 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-02-18 09:37:56,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-18 09:37:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:56,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:56,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:37:56,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:37:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:37:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:37:56,907 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-02-18 09:37:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:57,113 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-02-18 09:37:57,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:37:57,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:37:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:57,114 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:37:57,114 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:37:57,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:37:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:37:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-02-18 09:37:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:37:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-18 09:37:57,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-02-18 09:37:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:57,130 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-18 09:37:57,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:37:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-18 09:37:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:37:57,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:57,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:37:57,131 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-02-18 09:37:57,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:57,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:57,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:57,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:57,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:57,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:57,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:57,327 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:37:57,327 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-02-18 09:37:57,329 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:57,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:57,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:57,333 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:37:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:57,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:57,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:57,334 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-02-18 09:37:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:57,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:57,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:57,353 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-02-18 09:37:57,359 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-02-18 09:37:57,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,371 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 17 treesize of output 24 [2019-02-18 09:37:57,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,403 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 11 treesize of output 14 [2019-02-18 09:37:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-02-18 09:37:57,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,426 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-02-18 09:37:57,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:37:57,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:37:57,485 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 2 xjuncts. [2019-02-18 09:37:57,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-18 09:37:57,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,520 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 30 treesize of output 40 [2019-02-18 09:37:57,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:57,550 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:57,551 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-02-18 09:37:57,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:57,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:37:57,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-18 09:37:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:57,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:57,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:57,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-18 09:37:57,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:57,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:37:57,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:37:57,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:37:57,668 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-02-18 09:37:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:57,969 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-02-18 09:37:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:37:57,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:37:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:57,970 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:37:57,970 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:37:57,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:37:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:37:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-02-18 09:37:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:37:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-02-18 09:37:57,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-02-18 09:37:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:57,983 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-02-18 09:37:57,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:37:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-02-18 09:37:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:37:57,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:57,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:37:57,984 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:57,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-02-18 09:37:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:57,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:57,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:37:58,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:58,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:58,130 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:37:58,130 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-02-18 09:37:58,131 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:37:58,131 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:37:58,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:37:58,135 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:37:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:58,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:37:58,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:58,135 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-02-18 09:37:58,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:58,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:58,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:58,257 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-18 09:37:58,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:37:58,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-02-18 09:37:58,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-18 09:37:58,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-02-18 09:37:58,310 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-02-18 09:37:58,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,341 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-18 09:37:58,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,365 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-02-18 09:37:58,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,393 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-02-18 09:37:58,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:37:58,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,417 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-02-18 09:37:58,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,432 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-02-18 09:37:58,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-02-18 09:37:58,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,458 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:37:58,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:37:58,460 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-02-18 09:37:58,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:58,481 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-02-18 09:37:58,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-18 09:37:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:58,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:58,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:58,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:37:58,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:58,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:37:58,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:37:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:37:58,567 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-02-18 09:37:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:58,821 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-02-18 09:37:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:37:58,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:37:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:58,822 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:37:58,823 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:37:58,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:37:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:37:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:37:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:37:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:37:58,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-18 09:37:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:58,825 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:37:58,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:37:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:37:58,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:37:58,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:37:58,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:37:58,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:37:58,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:37:58,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:37:58,970 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-02-18 09:38:00,965 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-02-18 09:38:00,968 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:38:00,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:38:00,969 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-02-18 09:38:00,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-02-18 09:38:00,969 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-02-18 09:38:00,969 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-02-18 09:38:00,970 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-02-18 09:38:00,970 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-02-18 09:38:00,970 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-02-18 09:38:00,979 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:38:00 BoogieIcfgContainer [2019-02-18 09:38:00,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 09:38:00,980 INFO L168 Benchmark]: Toolchain (without parser) took 13975.13 ms. Allocated memory was 131.1 MB in the beginning and 350.2 MB in the end (delta: 219.2 MB). Free memory was 105.2 MB in the beginning and 247.4 MB in the end (delta: -142.2 MB). Peak memory consumption was 76.9 MB. Max. memory is 7.1 GB. [2019-02-18 09:38:00,980 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 131.1 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:38:00,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.74 ms. Allocated memory is still 131.1 MB. Free memory was 105.0 MB in the beginning and 102.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:38:00,981 INFO L168 Benchmark]: Boogie Preprocessor took 27.03 ms. Allocated memory is still 131.1 MB. Free memory was 102.7 MB in the beginning and 101.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-02-18 09:38:00,981 INFO L168 Benchmark]: RCFGBuilder took 335.41 ms. Allocated memory is still 131.1 MB. Free memory was 101.7 MB in the beginning and 91.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-02-18 09:38:00,982 INFO L168 Benchmark]: TraceAbstraction took 13547.56 ms. Allocated memory was 131.1 MB in the beginning and 350.2 MB in the end (delta: 219.2 MB). Free memory was 91.5 MB in the beginning and 247.4 MB in the end (delta: -155.9 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. [2019-02-18 09:38:00,984 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 131.1 MB. Free memory is still 106.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.74 ms. Allocated memory is still 131.1 MB. Free memory was 105.0 MB in the beginning and 102.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.03 ms. Allocated memory is still 131.1 MB. Free memory was 102.7 MB in the beginning and 101.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.41 ms. Allocated memory is still 131.1 MB. Free memory was 101.7 MB in the beginning and 91.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13547.56 ms. Allocated memory was 131.1 MB in the beginning and 350.2 MB in the end (delta: 219.2 MB). Free memory was 91.5 MB in the beginning and 247.4 MB in the end (delta: -155.9 MB). Peak memory consumption was 63.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: 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: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.4s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 125 SDslu, 1 SDs, 0 SdLazy, 960 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...