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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:34:16,820 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:34:16,822 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:34:16,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:34:16,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:34:16,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:34:16,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:34:16,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:34:16,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:34:16,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:34:16,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:34:16,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:34:16,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:34:16,851 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:34:16,852 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:34:16,852 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:34:16,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:34:16,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:34:16,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:34:16,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:34:16,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:34:16,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:34:16,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:34:16,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:34:16,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:34:16,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:34:16,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:34:16,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:34:16,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:34:16,886 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:34:16,886 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:34:16,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:34:16,887 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:34:16,888 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:34:16,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:34:16,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:34:16,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 17:34:16,909 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:34:16,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:34:16,910 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:34:16,910 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:34:16,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:34:16,910 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:34:16,911 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:34:16,911 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:34:16,911 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:34:16,911 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:34:16,911 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:34:16,912 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:34:16,912 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:34:16,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:34:16,913 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:34:16,913 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:34:16,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:34:16,913 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:34:16,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:34:16,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:34:16,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:34:16,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:34:16,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:34:16,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:34:16,915 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:34:16,915 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:34:16,915 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:34:16,916 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:34:16,916 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:34:16,916 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:34:16,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:16,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:34:16,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:34:16,917 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:34:16,917 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:34:16,917 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:34:16,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:34:16,918 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:34:16,918 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:34:16,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:34:16,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:34:16,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:34:16,971 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:34:16,971 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:34:16,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-01-31 17:34:16,972 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-31 17:34:17,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:34:17,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:34:17,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:17,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:34:17,011 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:34:17,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:17,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:34:17,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:34:17,063 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:34:17,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/1) ... [2019-01-31 17:34:17,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:34:17,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:34:17,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:34:17,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:34:17,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (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-01-31 17:34:17,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:34:17,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:34:17,509 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:34:17,510 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-31 17:34:17,511 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:17 BoogieIcfgContainer [2019-01-31 17:34:17,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:34:17,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:34:17,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:34:17,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:34:17,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:16" (1/2) ... [2019-01-31 17:34:17,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d49e5f2 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:34:17, skipping insertion in model container [2019-01-31 17:34:17,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:17" (2/2) ... [2019-01-31 17:34:17,522 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-31 17:34:17,533 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:34:17,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-31 17:34:17,562 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-31 17:34:17,592 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:34:17,593 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:34:17,593 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:34:17,593 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:34:17,593 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:34:17,593 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:34:17,593 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:34:17,594 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:34:17,608 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-31 17:34:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:34:17,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:17,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:34:17,617 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-31 17:34:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:17,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:17,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:17,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:17,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:17,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:17,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:17,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:17,835 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-31 17:34:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:18,041 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-31 17:34:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:18,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:34:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:18,057 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:34:18,058 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 17:34:18,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 17:34:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-31 17:34:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:34:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-31 17:34:18,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-31 17:34:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:18,094 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-31 17:34:18,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-31 17:34:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:18,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:18,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:18,095 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-31 17:34:18,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:18,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:18,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:18,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:18,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:18,219 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-31 17:34:18,274 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:18,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:22,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:22,291 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:22,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:22,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:22,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:22,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:22,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:22,453 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 15 treesize of output 18 [2019-01-31 17:34:22,471 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 18 treesize of output 24 [2019-01-31 17:34:22,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:22,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:22,517 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:22,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:22,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:22,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:22,541 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 22 treesize of output 45 [2019-01-31 17:34:22,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:22,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:22,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:22,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:22,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:22,997 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 31 treesize of output 40 [2019-01-31 17:34:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:23,227 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-31 17:34:23,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:23,280 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:23,293 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:23,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:23,342 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-01-31 17:34:23,343 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:23,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:23,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:23,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:23,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:23,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:23,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:23,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:23,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:23,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:23,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:23,540 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-31 17:34:23,738 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-31 17:34:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:24,098 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-31 17:34:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:24,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:34:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:24,099 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:34:24,100 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 17:34:24,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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-01-31 17:34:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 17:34:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-31 17:34:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:34:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-31 17:34:24,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-31 17:34:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:24,106 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-31 17:34:24,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-31 17:34:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:24,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:24,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:24,108 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:24,108 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-31 17:34:24,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:24,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:24,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:24,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:24,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:24,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:24,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:24,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:24,150 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-31 17:34:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:24,292 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-31 17:34:24,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:24,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:34:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:24,293 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:34:24,293 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:34:24,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:34:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-31 17:34:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:34:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-31 17:34:24,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-31 17:34:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:24,299 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-31 17:34:24,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-31 17:34:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:24,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:24,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:24,301 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-31 17:34:24,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:24,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:24,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:24,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:24,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:24,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:24,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:24,373 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-31 17:34:24,376 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:24,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:24,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:24,620 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:24,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:24,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:24,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:24,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:24,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:24,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:24,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:24,779 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-31 17:34:24,796 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 15 treesize of output 18 [2019-01-31 17:34:24,813 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 18 treesize of output 24 [2019-01-31 17:34:24,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:24,874 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:24,958 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:34:24,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,256 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-01-31 17:34:25,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,289 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-01-31 17:34:25,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,311 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 1 xjuncts. [2019-01-31 17:34:25,312 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-31 17:34:25,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:34:25,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:25,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:25,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:25,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:25,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:34:25,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:25,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:25,413 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-31 17:34:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:25,507 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-31 17:34:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:25,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:34:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:25,508 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:34:25,508 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:34:25,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:34:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-31 17:34:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:34:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-31 17:34:25,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-31 17:34:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:25,514 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-31 17:34:25,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-31 17:34:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:25,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:25,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:25,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-31 17:34:25,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:25,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:25,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:25,614 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:25,614 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-31 17:34:25,617 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:25,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:25,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:25,874 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:25,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:25,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:25,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:25,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:25,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:25,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:25,967 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-01-31 17:34:26,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,025 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-01-31 17:34:26,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,048 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 15 treesize of output 18 [2019-01-31 17:34:26,051 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 18 treesize of output 24 [2019-01-31 17:34:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:26,061 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:34:26,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,107 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,134 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-01-31 17:34:26,135 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-31 17:34:26,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:26,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:34:26,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:26,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:26,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:26,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:26,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:26,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:26,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:26,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:26,253 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-31 17:34:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:26,406 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-31 17:34:26,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:26,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:34:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:26,408 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:34:26,408 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:34:26,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:34:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:34:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-31 17:34:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:34:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-31 17:34:26,415 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-31 17:34:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:26,415 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-31 17:34:26,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-31 17:34:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:26,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:26,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:26,416 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-31 17:34:26,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:26,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:26,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:26,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:26,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:26,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:26,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:26,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:26,503 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-31 17:34:26,505 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:26,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:28,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:28,439 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:28,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:28,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:28,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:28,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:28,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:28,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:28,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:34:28,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,532 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:28,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:28,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:34:28,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:28,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:28,638 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 22 treesize of output 45 [2019-01-31 17:34:28,638 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,692 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,730 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-01-31 17:34:28,731 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:28,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:28,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:28,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:28,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:28,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:28,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:28,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:34:28,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:34:28,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:28,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:28,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:28,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:28,843 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-31 17:34:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:28,893 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-31 17:34:28,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:28,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:34:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:28,895 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:34:28,895 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:34:28,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:34:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:34:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-31 17:34:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:34:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-31 17:34:28,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-31 17:34:28,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:28,902 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-31 17:34:28,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-31 17:34:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:28,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:28,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:28,904 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-31 17:34:28,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:28,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:28,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:28,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:28,972 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:28,972 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-31 17:34:28,973 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:28,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:29,554 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:29,555 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:29,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:29,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:29,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:29,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:29,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:29,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:29,596 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 15 treesize of output 18 [2019-01-31 17:34:29,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:29,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:29,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,623 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 22 treesize of output 45 [2019-01-31 17:34:29,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,689 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 31 treesize of output 40 [2019-01-31 17:34:29,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:29,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:29,750 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,767 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,785 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-01-31 17:34:29,786 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:29,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:29,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:29,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:29,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:29,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:34:29,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:29,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:29,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-31 17:34:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:29,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:29,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:29,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:29,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:29,949 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-31 17:34:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:30,322 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-31 17:34:30,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:34:30,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:30,324 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:34:30,324 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:34:30,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:34:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-31 17:34:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:34:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-31 17:34:30,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-31 17:34:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:30,332 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-31 17:34:30,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-31 17:34:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:30,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:30,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:30,333 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:30,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-31 17:34:30,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:30,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:30,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:30,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:30,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:30,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:30,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:30,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:30,427 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-31 17:34:30,428 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:30,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:31,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:31,053 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:31,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:31,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:31,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:31,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:31,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:31,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:31,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:31,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,100 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 31 treesize of output 40 [2019-01-31 17:34:31,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:31,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:34:31,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:31,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:31,237 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 22 treesize of output 45 [2019-01-31 17:34:31,238 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,261 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,296 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-01-31 17:34:31,296 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:31,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:31,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:31,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:31,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:31,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:34:31,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:31,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:31,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:31,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:31,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:31,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:31,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:31,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:31,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:31,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:31,540 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-31 17:34:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:31,878 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-31 17:34:31,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:31,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:31,880 INFO L225 Difference]: With dead ends: 46 [2019-01-31 17:34:31,880 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:34:31,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:34:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-31 17:34:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:34:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-31 17:34:31,888 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-31 17:34:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:31,888 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-31 17:34:31,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-31 17:34:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:31,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:31,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:31,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:31,890 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-31 17:34:31,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:31,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:31,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:31,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:32,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:32,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:32,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:32,037 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:32,037 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-31 17:34:32,040 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:32,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:32,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:32,610 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:32,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:32,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:32,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:32,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:32,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:32,679 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 15 treesize of output 18 [2019-01-31 17:34:32,682 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 18 treesize of output 24 [2019-01-31 17:34:32,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,690 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:32,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,698 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 22 treesize of output 45 [2019-01-31 17:34:32,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,754 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 31 treesize of output 40 [2019-01-31 17:34:32,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:32,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:32,815 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,832 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,850 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-01-31 17:34:32,851 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:34:32,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:32,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:32,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:32,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:34:32,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:32,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:32,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:34:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:32,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:33,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:33,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:34:33,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:33,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:33,002 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-31 17:34:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:33,194 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-31 17:34:33,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:33,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:33,195 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:34:33,195 INFO L226 Difference]: Without dead ends: 49 [2019-01-31 17:34:33,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-31 17:34:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-31 17:34:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:34:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-31 17:34:33,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-31 17:34:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:33,204 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-31 17:34:33,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-31 17:34:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:33,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:33,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:33,206 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-31 17:34:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:33,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:33,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:33,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:33,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:33,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:33,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:33,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:33,254 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-31 17:34:33,258 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:33,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:33,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:33,486 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:33,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:33,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:33,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:33,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:33,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:33,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:33,593 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-01-31 17:34:33,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:33,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:33,627 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-01-31 17:34:33,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,643 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 15 treesize of output 18 [2019-01-31 17:34:33,645 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 18 treesize of output 24 [2019-01-31 17:34:33,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:33,652 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:34:33,653 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,664 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,693 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-01-31 17:34:33,694 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-31 17:34:33,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:33,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:34:33,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:33,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:33,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:33,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:33,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:33,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:33,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:33,806 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-31 17:34:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:34,021 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-31 17:34:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:34,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:34:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:34,024 INFO L225 Difference]: With dead ends: 36 [2019-01-31 17:34:34,024 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:34:34,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:34:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:34:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-31 17:34:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:34:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-31 17:34:34,033 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-31 17:34:34,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:34,033 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-31 17:34:34,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-31 17:34:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:34,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:34,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:34,034 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-31 17:34:34,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:34,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:34,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:34,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:34,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:34,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:34,093 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:34,093 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-31 17:34:34,095 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:34,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:34,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:34,340 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:34,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:34,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:34,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:34,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:34,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:34,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:34,407 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 15 treesize of output 18 [2019-01-31 17:34:34,414 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 18 treesize of output 24 [2019-01-31 17:34:34,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:34,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,447 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 22 treesize of output 45 [2019-01-31 17:34:34,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,511 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 31 treesize of output 40 [2019-01-31 17:34:34,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:34,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:34,634 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,707 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-01-31 17:34:34,707 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:34,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:34:34,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:34,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:34,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:34,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:34:34,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:34,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:34,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:34,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:34,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:34,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:34,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:34,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:34,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:34,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:34,913 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-31 17:34:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:35,348 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-31 17:34:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:34:35,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:34:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:35,349 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:34:35,350 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:34:35,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:34:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-31 17:34:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:34:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-31 17:34:35,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-31 17:34:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:35,360 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-31 17:34:35,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-31 17:34:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:34:35,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:35,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:34:35,361 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-31 17:34:35,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:35,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:35,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:35,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:34:35,403 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-31 17:34:35,403 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:35,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:35,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:35,537 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:34:35,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:35,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:35,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:35,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:35,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:35,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:35,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:35,558 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 15 treesize of output 18 [2019-01-31 17:34:35,566 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 18 treesize of output 20 [2019-01-31 17:34:35,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,576 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:34:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:34:35,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,680 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 26 treesize of output 25 [2019-01-31 17:34:35,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:34:35,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:34:35,731 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,863 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,889 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-01-31 17:34:35,889 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-31 17:34:35,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:35,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-31 17:34:35,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:35,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:35,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-31 17:34:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:35,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:36,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:36,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:34:36,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:36,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:34:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:34:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:34:36,017 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-31 17:34:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:36,134 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-31 17:34:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:34:36,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:34:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:36,135 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:34:36,135 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:34:36,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:34:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:34:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-31 17:34:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:34:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-31 17:34:36,145 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-31 17:34:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:36,145 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-31 17:34:36,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:34:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-31 17:34:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:36,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:36,146 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:34:36,146 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:36,147 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-31 17:34:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:36,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:36,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:36,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:36,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:36,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:36,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:36,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:36,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:34:36,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:34:36,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:34:36,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:36,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,279 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 31 treesize of output 40 [2019-01-31 17:34:36,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,313 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:36,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:36,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:34:36,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:36,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:36,411 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 22 treesize of output 45 [2019-01-31 17:34:36,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,441 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,449 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,475 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-01-31 17:34:36,476 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:36,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:36,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:36,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:36,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:34:36,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:36,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-31 17:34:36,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:36,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:36,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:36,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:36,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:36,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:36,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:34:36,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:36,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:34:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:34:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:36,660 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-31 17:34:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:37,001 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-31 17:34:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:37,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:34:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:37,003 INFO L225 Difference]: With dead ends: 65 [2019-01-31 17:34:37,004 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 17:34:37,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:34:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 17:34:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-31 17:34:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:34:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-31 17:34:37,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-31 17:34:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:37,015 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-31 17:34:37,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:34:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-31 17:34:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:37,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:37,016 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-31 17:34:37,016 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:37,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:37,016 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-31 17:34:37,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:37,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:37,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:37,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:37,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:37,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:37,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:37,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:37,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:34:37,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:34:37,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:34:37,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:37,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:37,159 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 15 treesize of output 18 [2019-01-31 17:34:37,162 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 18 treesize of output 24 [2019-01-31 17:34:37,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,172 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:37,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,181 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 22 treesize of output 45 [2019-01-31 17:34:37,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-31 17:34:37,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:37,318 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,326 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,354 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-01-31 17:34:37,355 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:37,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:37,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:37,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:34:37,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:37,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-31 17:34:37,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:37,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:34:37,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:37,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:37,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:37,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:37,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:37,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:34:37,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:37,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:34:37,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:34:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:37,588 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-31 17:34:37,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:37,964 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-31 17:34:37,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:37,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-31 17:34:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:37,965 INFO L225 Difference]: With dead ends: 53 [2019-01-31 17:34:37,966 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 17:34:37,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 17:34:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-31 17:34:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:34:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-31 17:34:37,977 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-31 17:34:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:37,977 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-31 17:34:37,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:34:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-31 17:34:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:37,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:37,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:37,978 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-31 17:34:37,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:37,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:37,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:38,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:38,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:38,077 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:38,077 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-31 17:34:38,078 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:38,078 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:39,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:39,086 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:39,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:39,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:39,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:39,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:39,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:39,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:39,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,179 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 31 treesize of output 40 [2019-01-31 17:34:39,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:39,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:39,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:34:39,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:39,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:39,319 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 22 treesize of output 45 [2019-01-31 17:34:39,319 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,344 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,360 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,390 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-01-31 17:34:39,391 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:39,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:39,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:39,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:39,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:39,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:39,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:39,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:39,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:39,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:39,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:39,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:39,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:39,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:39,549 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-31 17:34:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:39,816 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-31 17:34:39,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:34:39,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:39,818 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:34:39,818 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:34:39,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:34:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-31 17:34:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:34:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-31 17:34:39,830 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-31 17:34:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:39,831 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-31 17:34:39,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-31 17:34:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:39,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:39,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:39,832 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-31 17:34:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:39,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:39,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:39,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:39,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:39,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:39,957 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-31 17:34:39,958 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:39,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:40,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:40,724 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:34:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:40,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:40,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:40,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:40,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:40,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:40,755 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 15 treesize of output 18 [2019-01-31 17:34:40,760 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 18 treesize of output 24 [2019-01-31 17:34:40,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:40,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:40,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:40,779 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:34:40,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:40,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:40,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:40,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:40,842 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-01-31 17:34:40,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:40,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:40,864 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-01-31 17:34:40,865 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:40,877 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:40,890 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-01-31 17:34:40,891 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-31 17:34:40,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:40,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:40,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-31 17:34:41,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-31 17:34:41,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:116 [2019-01-31 17:34:41,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,102 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:41,103 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 36 treesize of output 49 [2019-01-31 17:34:41,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:41,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,153 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:41,154 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 32 treesize of output 45 [2019-01-31 17:34:41,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:41,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,197 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 32 treesize of output 40 [2019-01-31 17:34:41,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:41,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-31 17:34:41,232 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:105, output treesize:61 [2019-01-31 17:34:41,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,274 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 32 treesize of output 42 [2019-01-31 17:34:41,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:41,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,324 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 34 treesize of output 44 [2019-01-31 17:34:41,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:41,366 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:41,367 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 34 treesize of output 44 [2019-01-31 17:34:41,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:41,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-31 17:34:41,400 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-31 17:34:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:41,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:41,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-31 17:34:41,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:41,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:41,470 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-31 17:34:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:42,256 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-31 17:34:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 17:34:42,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:34:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:42,259 INFO L225 Difference]: With dead ends: 81 [2019-01-31 17:34:42,259 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:34:42,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:34:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:34:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-31 17:34:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:34:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-31 17:34:42,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-31 17:34:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:42,275 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-31 17:34:42,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-31 17:34:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:42,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:42,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:42,276 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-31 17:34:42,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:42,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:42,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:42,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:42,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:42,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:42,349 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:42,350 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-31 17:34:42,351 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:42,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:43,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:43,219 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:34:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:43,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:43,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:43,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:43,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:43,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:43,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:43,260 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 15 treesize of output 18 [2019-01-31 17:34:43,266 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 18 treesize of output 24 [2019-01-31 17:34:43,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,274 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:43,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,286 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 22 treesize of output 45 [2019-01-31 17:34:43,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,344 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 31 treesize of output 40 [2019-01-31 17:34:43,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:43,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:43,403 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,413 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,420 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,438 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:43,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:43,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:43,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,525 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:43,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:34:43,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:43,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-31 17:34:43,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:43,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-31 17:34:43,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:43,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:43,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:34:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:43,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:44,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:44,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:34:44,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:44,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:44,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:44,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:34:44,542 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-31 17:34:45,213 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-31 17:34:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:45,861 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-31 17:34:45,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:45,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:34:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:45,863 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:34:45,863 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 17:34:45,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:34:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 17:34:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-31 17:34:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:34:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-31 17:34:45,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-31 17:34:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:45,880 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-31 17:34:45,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-31 17:34:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:45,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:45,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:45,881 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-31 17:34:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:45,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:45,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:45,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:45,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:45,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:45,976 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-31 17:34:45,977 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:45,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:46,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:46,565 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:46,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:46,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:46,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:46,566 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:46,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:46,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:46,616 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 26 treesize of output 25 [2019-01-31 17:34:46,740 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 17:34:46,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:46,792 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:34:46,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:46,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:46,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:46,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:46,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:34:46,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,860 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 15 treesize of output 18 [2019-01-31 17:34:46,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:34:46,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:34:46,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:34:46,904 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,917 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:46,949 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-01-31 17:34:46,950 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:34:47,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:47,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:34:47,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:47,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:47,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:34:47,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:47,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:47,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:47,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:47,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:47,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:34:47,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:47,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:47,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-31 17:34:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:47,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:47,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:47,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:34:47,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:47,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:47,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:47,148 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-31 17:34:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:47,503 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-31 17:34:47,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:34:47,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:47,505 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:34:47,505 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:34:47,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:34:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-31 17:34:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:34:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-31 17:34:47,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-31 17:34:47,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:47,518 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-31 17:34:47,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-31 17:34:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:47,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:47,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:47,519 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:47,520 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-31 17:34:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:47,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:47,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:47,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:47,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:34:47,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:47,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:47,597 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-31 17:34:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:47,655 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-31 17:34:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:34:47,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:34:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:47,656 INFO L225 Difference]: With dead ends: 51 [2019-01-31 17:34:47,656 INFO L226 Difference]: Without dead ends: 46 [2019-01-31 17:34:47,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:34:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-31 17:34:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-31 17:34:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:34:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-31 17:34:47,671 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-31 17:34:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:47,671 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-31 17:34:47,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:34:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-31 17:34:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:47,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:47,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:47,672 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:47,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:47,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-31 17:34:47,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:47,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:47,948 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-31 17:34:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:47,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:47,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:47,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:47,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:47,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:47,991 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:48,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:34:48,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:34:48,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:34:48,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:48,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:48,022 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 15 treesize of output 18 [2019-01-31 17:34:48,025 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 18 treesize of output 24 [2019-01-31 17:34:48,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:48,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,046 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 22 treesize of output 45 [2019-01-31 17:34:48,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,101 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 31 treesize of output 40 [2019-01-31 17:34:48,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:48,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:48,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,171 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,204 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-01-31 17:34:48,204 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:48,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:34:48,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:48,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:48,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:34:48,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:48,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:34:48,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:48,325 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:48,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:34:48,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:48,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:48,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:34:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:48,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:48,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:34:48,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:48,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:48,495 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-31 17:34:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:49,217 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-31 17:34:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:34:49,217 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:34:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:49,219 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:34:49,219 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:34:49,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:34:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:34:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-31 17:34:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:34:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-31 17:34:49,245 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-31 17:34:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:49,245 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-31 17:34:49,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-31 17:34:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:49,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:49,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:49,246 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-31 17:34:49,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:49,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:49,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:49,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:49,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:49,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:49,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:49,318 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-31 17:34:49,319 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:49,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:49,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:49,631 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:49,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:49,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:49,631 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:49,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:49,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:49,676 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 15 treesize of output 18 [2019-01-31 17:34:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:49,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,697 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 22 treesize of output 45 [2019-01-31 17:34:49,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,769 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 31 treesize of output 40 [2019-01-31 17:34:49,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:49,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:49,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,895 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,923 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-01-31 17:34:49,923 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:49,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:49,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:49,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:49,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:49,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:49,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:34:49,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:50,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:50,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:34:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:50,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:50,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:50,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:34:50,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:50,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:50,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:50,190 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-31 17:34:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:50,347 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-31 17:34:50,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:50,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:50,349 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:34:50,349 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:34:50,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:34:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-31 17:34:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:34:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-31 17:34:50,371 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-31 17:34:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:50,371 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-31 17:34:50,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-31 17:34:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:50,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:50,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:50,373 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-31 17:34:50,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:50,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:50,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:50,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:34:50,421 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-31 17:34:50,422 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:50,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:50,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:50,709 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:50,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:50,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:50,710 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:50,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:50,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:50,899 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-31 17:34:50,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:50,922 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 31 treesize of output 40 [2019-01-31 17:34:51,112 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:34:51,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:51,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:51,149 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 18 [2019-01-31 17:34:51,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:51,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:51,191 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 22 treesize of output 45 [2019-01-31 17:34:51,191 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,205 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,366 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-01-31 17:34:51,366 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:51,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:51,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:51,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:51,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,435 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:51,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-01-31 17:34:51,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:51,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-31 17:34:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:51,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:51,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:51,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:34:51,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:51,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:34:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:34:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:51,508 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-31 17:34:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:51,740 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-31 17:34:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:34:51,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 17:34:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:51,743 INFO L225 Difference]: With dead ends: 63 [2019-01-31 17:34:51,743 INFO L226 Difference]: Without dead ends: 62 [2019-01-31 17:34:51,743 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-01-31 17:34:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-31 17:34:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-31 17:34:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 17:34:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-31 17:34:51,764 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-31 17:34:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:51,764 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-31 17:34:51,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:34:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-31 17:34:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:34:51,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:51,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:34:51,766 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-31 17:34:51,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:51,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:51,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:51,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:51,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:51,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:51,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:51,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:51,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:51,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:51,838 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:51,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:34:51,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:34:51,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:34:51,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:51,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:51,872 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 15 treesize of output 18 [2019-01-31 17:34:51,876 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 18 treesize of output 24 [2019-01-31 17:34:51,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:51,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,888 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 22 treesize of output 45 [2019-01-31 17:34:51,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,945 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 31 treesize of output 40 [2019-01-31 17:34:51,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:51,972 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:52,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:52,006 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,014 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,041 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-01-31 17:34:52,041 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:52,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:34:52,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:52,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:52,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:52,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:52,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:52,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:52,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:52,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:34:52,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:52,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:52,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:52,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:34:52,179 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-31 17:34:52,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:52,378 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-31 17:34:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:52,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:34:52,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:52,379 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:34:52,380 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:34:52,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:34:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:34:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-31 17:34:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:34:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-31 17:34:52,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-31 17:34:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:52,402 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-31 17:34:52,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-31 17:34:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:52,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:52,403 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-31 17:34:52,403 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-31 17:34:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:52,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:52,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:52,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:34:52,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:52,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:52,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:52,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:52,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:52,494 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:52,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:34:52,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:34:52,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:34:52,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:52,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:52,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,533 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 31 treesize of output 40 [2019-01-31 17:34:52,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,564 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:52,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:52,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:34:52,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:52,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:52,638 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 22 treesize of output 45 [2019-01-31 17:34:52,639 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,654 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,671 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,690 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-01-31 17:34:52,690 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:52,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:52,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:52,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:52,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:34:52,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:52,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-31 17:34:52,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:52,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:52,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:52,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:52,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:34:52,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:52,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:52,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:34:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:52,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:52,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:52,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-31 17:34:52,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:52,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:52,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:52,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:34:52,953 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-31 17:34:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:53,395 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-31 17:34:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:34:53,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:34:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:53,397 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:34:53,397 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:34:53,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:34:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:34:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-31 17:34:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:34:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-31 17:34:53,421 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-31 17:34:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:53,421 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-31 17:34:53,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-31 17:34:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:53,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:53,422 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:34:53,422 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-31 17:34:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:53,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:53,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:53,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:53,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:53,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:53,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:53,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:53,545 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:34:53,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:34:53,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:34:53,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:53,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:53,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,579 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 31 treesize of output 40 [2019-01-31 17:34:53,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,628 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:53,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:53,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:34:53,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:53,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:53,730 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 22 treesize of output 45 [2019-01-31 17:34:53,730 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,745 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,780 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-01-31 17:34:53,780 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:53,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:53,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:53,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:34:53,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:53,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:53,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-31 17:34:53,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:53,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:53,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:54,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:54,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:54,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-31 17:34:54,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:54,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:54,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:34:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:54,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:54,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:54,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:34:54,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:54,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:34:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:34:54,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:34:54,189 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-31 17:34:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:54,726 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-31 17:34:54,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:34:54,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:34:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:54,728 INFO L225 Difference]: With dead ends: 107 [2019-01-31 17:34:54,728 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:34:54,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:34:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:34:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-31 17:34:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:34:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-31 17:34:54,764 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-31 17:34:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:54,764 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-31 17:34:54,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:34:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-31 17:34:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:54,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:54,765 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:34:54,766 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-31 17:34:54,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:54,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:54,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:54,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:54,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:54,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:54,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:54,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:54,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:54,927 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:54,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:54,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:54,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:54,957 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 15 treesize of output 18 [2019-01-31 17:34:54,960 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 18 treesize of output 24 [2019-01-31 17:34:54,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,965 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:54,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:54,970 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 22 treesize of output 45 [2019-01-31 17:34:54,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:54,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,030 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 31 treesize of output 40 [2019-01-31 17:34:55,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,056 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:55,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:55,088 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,098 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,125 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-01-31 17:34:55,125 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:55,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:55,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:55,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:55,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:55,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:55,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:55,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:34:55,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:55,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-31 17:34:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:55,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-31 17:34:55,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:55,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:55,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:34:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:55,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:55,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:55,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:34:55,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:55,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:34:55,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:34:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:34:55,451 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-31 17:34:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:55,856 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-31 17:34:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:34:55,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:34:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:55,859 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:34:55,859 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:34:55,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:34:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:34:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-31 17:34:55,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:34:55,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-31 17:34:55,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-31 17:34:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:55,880 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-31 17:34:55,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:34:55,880 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-31 17:34:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:55,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:55,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:34:55,881 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-31 17:34:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:55,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:55,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:56,034 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:34:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:56,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:56,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:56,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:34:56,116 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-31 17:34:56,117 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:56,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:56,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:56,659 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:34:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:56,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:56,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:56,659 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:56,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:56,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:56,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:56,699 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 15 treesize of output 18 [2019-01-31 17:34:56,704 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 18 treesize of output 24 [2019-01-31 17:34:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:56,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,723 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 22 treesize of output 45 [2019-01-31 17:34:56,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,784 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 31 treesize of output 40 [2019-01-31 17:34:56,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,811 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:56,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:56,857 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,866 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,873 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,891 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-01-31 17:34:56,891 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:56,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:56,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:56,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:56,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:56,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:56,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:56,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:56,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:56,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:57,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:57,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:34:57,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:57,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:34:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:34:57,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:34:57,044 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-31 17:34:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:57,308 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-31 17:34:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:34:57,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:34:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:57,309 INFO L225 Difference]: With dead ends: 72 [2019-01-31 17:34:57,310 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:34:57,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:34:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-31 17:34:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:34:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-31 17:34:57,333 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-31 17:34:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:57,333 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-31 17:34:57,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:34:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-31 17:34:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:57,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:57,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:34:57,334 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-31 17:34:57,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:57,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:57,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:57,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:57,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:57,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:57,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:57,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:34:57,399 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-31 17:34:57,400 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:57,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:58,037 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:58,037 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:34:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:58,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:58,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:58,038 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:58,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:58,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:58,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:58,070 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 15 treesize of output 18 [2019-01-31 17:34:58,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:34:58,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,077 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:58,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,088 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 22 treesize of output 45 [2019-01-31 17:34:58,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,158 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 31 treesize of output 40 [2019-01-31 17:34:58,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:58,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:58,214 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,223 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,232 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,248 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-01-31 17:34:58,248 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:58,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:58,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:58,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:58,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:58,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:58,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:34:58,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,361 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:34:58,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:58,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:34:58,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:58,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:58,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:34:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:58,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:58,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:58,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:34:58,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:58,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:34:58,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:34:58,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:34:58,468 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-31 17:34:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:58,809 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-31 17:34:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:34:58,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:34:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:58,811 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:34:58,811 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:34:58,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:34:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:34:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-31 17:34:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-31 17:34:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-31 17:34:58,842 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-31 17:34:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:58,842 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-31 17:34:58,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:34:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-31 17:34:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:34:58,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:58,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:34:58,843 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:58,843 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-31 17:34:58,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:58,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:58,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:34:58,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:58,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:58,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:34:58,936 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-31 17:34:58,937 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:58,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:59,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:34:59,529 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:34:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:59,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:34:59,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:59,529 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:34:59,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:59,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:59,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:59,569 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 15 treesize of output 18 [2019-01-31 17:34:59,572 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 18 treesize of output 24 [2019-01-31 17:34:59,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,579 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:34:59,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,586 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 22 treesize of output 45 [2019-01-31 17:34:59,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,680 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 31 treesize of output 40 [2019-01-31 17:34:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,721 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:34:59,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:34:59,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,823 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,848 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:34:59,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:34:59,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:34:59,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:34:59,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:34:59,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:34:59,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:34:59,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:00,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:00,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:00,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:00,074 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:00,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:00,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:00,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:00,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:00,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:00,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:00,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:00,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:00,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:00,178 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-31 17:35:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:00,510 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-31 17:35:00,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:00,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:35:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:00,512 INFO L225 Difference]: With dead ends: 78 [2019-01-31 17:35:00,512 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:35:00,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:35:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-31 17:35:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:35:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-31 17:35:00,547 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-31 17:35:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:00,547 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-31 17:35:00,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-31 17:35:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:00,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:00,548 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:35:00,548 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:00,548 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-31 17:35:00,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:00,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:00,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:00,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:00,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:00,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:00,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:00,605 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-31 17:35:00,606 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:00,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:01,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:01,206 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:35:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:01,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:01,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:01,207 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:01,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:01,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:01,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:01,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,244 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 31 treesize of output 40 [2019-01-31 17:35:01,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,286 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:01,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:01,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,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, 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 18 [2019-01-31 17:35:01,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:01,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:01,360 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 22 treesize of output 45 [2019-01-31 17:35:01,360 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,391 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,408 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-01-31 17:35:01,409 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:01,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:01,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:01,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:01,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:35:01,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:01,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:01,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:01,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:35:01,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:01,598 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:01,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-31 17:35:01,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:01,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:01,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:01,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:01,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:01,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:35:01,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:01,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:35:01,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:35:01,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:01,711 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-31 17:35:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:02,179 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-31 17:35:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:35:02,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:35:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:02,181 INFO L225 Difference]: With dead ends: 95 [2019-01-31 17:35:02,181 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 17:35:02,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 17:35:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-31 17:35:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:35:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-31 17:35:02,210 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-31 17:35:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:02,211 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-31 17:35:02,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:35:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-31 17:35:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:02,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:02,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:02,211 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:02,212 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-31 17:35:02,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:02,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:02,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:02,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:02,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:02,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:02,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:02,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:02,315 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-31 17:35:02,316 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:02,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:02,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:02,508 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:02,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:02,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:02,509 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:02,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:02,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:02,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:02,544 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 15 treesize of output 18 [2019-01-31 17:35:02,546 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 18 treesize of output 24 [2019-01-31 17:35:02,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,564 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,574 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 22 treesize of output 45 [2019-01-31 17:35:02,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,608 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,637 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 31 treesize of output 40 [2019-01-31 17:35:02,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:02,695 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,703 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,712 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,731 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-01-31 17:35:02,731 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:02,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:02,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:02,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:02,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:02,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:35:02,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:02,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:02,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:02,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:02,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:02,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:35:02,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:02,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:35:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:35:02,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:02,878 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-31 17:35:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:03,719 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-31 17:35:03,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:03,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:35:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:03,721 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:35:03,721 INFO L226 Difference]: Without dead ends: 87 [2019-01-31 17:35:03,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-31 17:35:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-31 17:35:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 17:35:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-31 17:35:03,764 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-31 17:35:03,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:03,764 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-31 17:35:03,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:35:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-31 17:35:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:03,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:03,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:03,765 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-31 17:35:03,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:03,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:03,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:03,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:03,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:03,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:03,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:03,852 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:03,853 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-31 17:35:03,854 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:03,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:04,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:04,138 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:35:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:04,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:04,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:04,138 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:04,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:04,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:04,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:04,171 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 15 treesize of output 18 [2019-01-31 17:35:04,176 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 18 treesize of output 24 [2019-01-31 17:35:04,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:04,198 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:35:04,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,251 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-01-31 17:35:04,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,273 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-01-31 17:35:04,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,278 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,291 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-01-31 17:35:04,291 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-31 17:35:04,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:35:04,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:04,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:35:04,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:04,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-31 17:35:04,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:04,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 17:35:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:04,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-31 17:35:04,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:04,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:04,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 17:35:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:04,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:04,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:04,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:35:04,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:04,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:04,465 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-31 17:35:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:04,867 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-31 17:35:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:35:04,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:35:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:04,869 INFO L225 Difference]: With dead ends: 122 [2019-01-31 17:35:04,869 INFO L226 Difference]: Without dead ends: 121 [2019-01-31 17:35:04,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-31 17:35:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-31 17:35:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-31 17:35:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-31 17:35:04,942 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-31 17:35:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:04,942 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-31 17:35:04,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-31 17:35:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:04,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:04,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:04,943 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-31 17:35:04,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:04,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:04,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:04,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:05,079 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:35:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:05,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:05,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:05,098 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:05,098 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-31 17:35:05,099 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:05,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:05,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:05,573 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:05,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:05,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:05,573 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:05,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:05,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:05,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:05,590 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 26 treesize of output 25 [2019-01-31 17:35:05,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,612 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:35:05,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:35:05,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,691 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 15 treesize of output 18 [2019-01-31 17:35:05,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:35:05,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:35:05,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:35:05,704 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,720 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,753 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-01-31 17:35:05,753 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:35:05,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:35:05,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:05,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:35:05,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:05,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:05,825 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 28 treesize of output 41 [2019-01-31 17:35:05,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:05,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:05,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:35:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:05,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:05,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:05,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:05,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:05,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:05,898 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-31 17:35:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:06,120 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-31 17:35:06,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:06,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:35:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:06,123 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:35:06,123 INFO L226 Difference]: Without dead ends: 108 [2019-01-31 17:35:06,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-31 17:35:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-31 17:35:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:35:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-31 17:35:06,178 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-31 17:35:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:06,178 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-31 17:35:06,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-31 17:35:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:06,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:06,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:06,179 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-31 17:35:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:06,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:06,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:06,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:06,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:06,336 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-31 17:35:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:06,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:06,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:06,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:06,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:06,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:06,351 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:06,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:06,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:06,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:06,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:06,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:06,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,383 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 31 treesize of output 40 [2019-01-31 17:35:06,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:06,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:35:06,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:06,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:06,486 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 22 treesize of output 45 [2019-01-31 17:35:06,486 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,533 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-01-31 17:35:06,534 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:06,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:06,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:06,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:06,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:35:06,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:06,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:06,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,643 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:06,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:06,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2019-01-31 17:35:06,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:06,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:06,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:06,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:06,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:06,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:35:06,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:06,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:35:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:35:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:06,732 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-31 17:35:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:07,078 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-31 17:35:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:07,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:35:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:07,079 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:35:07,080 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:35:07,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:35:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:35:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-31 17:35:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-31 17:35:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-31 17:35:07,124 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-31 17:35:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:07,124 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-31 17:35:07,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:35:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-31 17:35:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:07,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:07,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:07,125 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-31 17:35:07,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:07,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:07,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:07,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:07,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:07,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:07,448 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-31 17:35:07,450 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:07,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:08,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:08,120 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:08,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:08,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:08,121 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:08,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:08,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:08,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:08,137 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 14 treesize of output 17 [2019-01-31 17:35:08,140 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 17 treesize of output 19 [2019-01-31 17:35:08,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,162 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 9 [2019-01-31 17:35:08,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,193 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 15 treesize of output 18 [2019-01-31 17:35:08,198 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 18 treesize of output 20 [2019-01-31 17:35:08,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:35:08,214 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:35:08,215 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,238 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,245 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,256 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-01-31 17:35:08,257 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-31 17:35:08,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:35:08,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 17:35:08,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,295 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 21 treesize of output 27 [2019-01-31 17:35:08,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:08,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-31 17:35:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:08,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:08,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:08,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:35:08,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:08,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:08,351 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-31 17:35:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:08,550 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-31 17:35:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:08,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:35:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:08,553 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:35:08,553 INFO L226 Difference]: Without dead ends: 109 [2019-01-31 17:35:08,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-31 17:35:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-31 17:35:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-31 17:35:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-31 17:35:08,601 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-31 17:35:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:08,601 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-31 17:35:08,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-31 17:35:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:08,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:08,602 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:35:08,602 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:08,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:08,602 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-31 17:35:08,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:08,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:08,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:08,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:08,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:08,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:08,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:08,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:08,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:08,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:08,699 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:08,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:08,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:08,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:08,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:08,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:08,733 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 15 treesize of output 18 [2019-01-31 17:35:08,735 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 18 treesize of output 24 [2019-01-31 17:35:08,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,772 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:08,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,779 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 22 treesize of output 45 [2019-01-31 17:35:08,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,836 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 31 treesize of output 40 [2019-01-31 17:35:08,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,862 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:08,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:08,894 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,929 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-01-31 17:35:08,930 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:08,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:08,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:08,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:08,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:08,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:08,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:35:08,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:09,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:09,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,039 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:09,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-31 17:35:09,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:09,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:09,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:09,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:09,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:09,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:35:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:09,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:09,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:09,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:35:09,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:09,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:35:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:35:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:35:09,284 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-31 17:35:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:09,700 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-31 17:35:09,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:09,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:35:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:09,702 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:35:09,703 INFO L226 Difference]: Without dead ends: 116 [2019-01-31 17:35:09,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-31 17:35:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-31 17:35:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 17:35:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-31 17:35:09,753 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-31 17:35:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:09,753 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-31 17:35:09,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:35:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-31 17:35:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:09,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:09,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:09,754 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-31 17:35:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:09,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:09,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:09,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:09,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:09,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:09,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:09,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:35:09,933 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-31 17:35:09,933 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:09,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:10,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:10,675 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:35:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:10,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:10,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:10,676 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:10,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:10,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:10,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:10,709 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 15 treesize of output 18 [2019-01-31 17:35:10,711 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 18 treesize of output 24 [2019-01-31 17:35:10,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,726 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,734 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 22 treesize of output 45 [2019-01-31 17:35:10,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,797 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 31 treesize of output 40 [2019-01-31 17:35:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,824 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:10,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:10,887 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,895 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,903 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,921 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:10,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:10,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:10,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:10,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:10,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:10,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:35:10,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:11,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:11,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,038 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-31 17:35:11,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:11,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:35:11,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:11,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:35:11,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:11,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:35:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:11,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:11,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:11,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:35:11,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:11,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:35:11,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:35:11,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:11,206 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-31 17:35:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:11,734 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-31 17:35:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:35:11,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:35:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:11,736 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:35:11,736 INFO L226 Difference]: Without dead ends: 136 [2019-01-31 17:35:11,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:35:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-31 17:35:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-31 17:35:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-31 17:35:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-31 17:35:11,801 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-31 17:35:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:11,802 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-31 17:35:11,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:35:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-31 17:35:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:11,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:11,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:11,803 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:11,803 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-31 17:35:11,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:11,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:11,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:11,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:11,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:11,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:11,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:11,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:11,919 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:11,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:11,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:11,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:11,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:11,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:11,953 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 15 treesize of output 18 [2019-01-31 17:35:11,958 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 18 treesize of output 24 [2019-01-31 17:35:11,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:11,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:11,972 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 22 treesize of output 45 [2019-01-31 17:35:11,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:11,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,045 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 31 treesize of output 40 [2019-01-31 17:35:12,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:12,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:12,148 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,157 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,184 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:12,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:12,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,272 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:12,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:35:12,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:12,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-31 17:35:12,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:35:12,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:12,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-31 17:35:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,369 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:12,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:12,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:35:12,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:12,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:12,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-31 17:35:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:12,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:12,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:12,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:35:12,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:12,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:35:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:35:12,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:12,483 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-31 17:35:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:13,091 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-31 17:35:13,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:13,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:35:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:13,094 INFO L225 Difference]: With dead ends: 172 [2019-01-31 17:35:13,094 INFO L226 Difference]: Without dead ends: 167 [2019-01-31 17:35:13,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-31 17:35:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-31 17:35:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-31 17:35:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-31 17:35:13,179 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-31 17:35:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:13,179 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-31 17:35:13,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:35:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-31 17:35:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:35:13,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:13,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:35:13,181 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-31 17:35:13,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:13,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:13,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:13,498 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-01-31 17:35:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:13,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:13,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:13,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:13,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:13,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:13,582 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:13,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:35:13,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:35:13,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:35:13,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:13,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:13,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,613 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 31 treesize of output 40 [2019-01-31 17:35:13,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,671 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:13,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:35:13,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:13,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:13,775 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 22 treesize of output 45 [2019-01-31 17:35:13,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,808 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,826 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:13,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:13,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:13,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:13,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:13,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:35:13,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:13,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-31 17:35:13,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:35:13,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:13,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:13,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-31 17:35:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:13,998 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:13,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:35:14,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:14,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:14,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-31 17:35:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:14,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:14,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:35:14,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:14,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:35:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:35:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:14,115 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-31 17:35:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:14,554 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-31 17:35:14,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:14,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:35:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:14,556 INFO L225 Difference]: With dead ends: 140 [2019-01-31 17:35:14,557 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 17:35:14,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:35:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 17:35:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-31 17:35:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:35:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-31 17:35:14,608 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-31 17:35:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:14,608 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-31 17:35:14,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:35:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-31 17:35:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:14,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:14,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:14,609 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-31 17:35:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:14,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:14,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:14,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:14,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:14,776 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:14,776 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-31 17:35:14,778 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:14,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:15,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:15,417 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:35:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:15,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:15,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:15,417 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:15,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:15,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:15,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:15,457 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 15 treesize of output 18 [2019-01-31 17:35:15,466 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 18 treesize of output 24 [2019-01-31 17:35:15,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:15,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,489 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 22 treesize of output 45 [2019-01-31 17:35:15,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,548 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 31 treesize of output 40 [2019-01-31 17:35:15,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,575 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:15,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:15,606 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,614 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,623 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,641 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:15,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:15,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:15,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:35:15,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:15,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:15,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:15,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:15,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:35:15,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:15,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:15,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-31 17:35:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:15,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:15,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:35:15,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:15,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:15,854 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-31 17:35:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:16,286 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-31 17:35:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:16,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:35:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:16,288 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:35:16,288 INFO L226 Difference]: Without dead ends: 76 [2019-01-31 17:35:16,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-31 17:35:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-31 17:35:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 17:35:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-31 17:35:16,352 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-31 17:35:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:16,353 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-31 17:35:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-31 17:35:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:16,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:16,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:16,353 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-31 17:35:16,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:16,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:16,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:16,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:16,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:16,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:16,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:16,486 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-31 17:35:16,486 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:16,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:17,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:17,382 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:35:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:17,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:17,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:17,382 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:17,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:17,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:17,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:17,415 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 15 treesize of output 18 [2019-01-31 17:35:17,417 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 18 treesize of output 24 [2019-01-31 17:35:17,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:17,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,441 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 22 treesize of output 45 [2019-01-31 17:35:17,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,513 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 31 treesize of output 40 [2019-01-31 17:35:17,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,539 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:17,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:17,571 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,581 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,589 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,608 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:17,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:17,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:17,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:17,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:35:17,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:17,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:17,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:17,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:17,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:17,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,779 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:17,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:17,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:35:17,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:17,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:17,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-31 17:35:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:17,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:17,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:35:17,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:17,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:35:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:35:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:17,883 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-31 17:35:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:18,420 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-31 17:35:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:18,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:35:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:18,422 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:35:18,422 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:35:18,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:35:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:35:18,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-31 17:35:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-31 17:35:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-31 17:35:18,476 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-31 17:35:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:18,477 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-31 17:35:18,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:35:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-31 17:35:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:18,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:18,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:18,477 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-31 17:35:18,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:18,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:18,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:18,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:18,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:18,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:18,683 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:18,683 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-31 17:35:18,684 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:18,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:19,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:19,431 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:19,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:19,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:19,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:19,431 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:19,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:19,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:19,480 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 15 treesize of output 18 [2019-01-31 17:35:19,495 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 18 treesize of output 20 [2019-01-31 17:35:19,505 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:35:19,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-31 17:35:19,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,527 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:19,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-31 17:35:19,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,569 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 2 case distinctions, treesize of input 21 treesize of output 15 [2019-01-31 17:35:19,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:35:19,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:35:19,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-31 17:35:19,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-31 17:35:19,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:19,611 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:19,612 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 23 treesize of output 28 [2019-01-31 17:35:19,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:19,623 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 2 xjuncts. [2019-01-31 17:35:19,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-31 17:35:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:19,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:19,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:35:19,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-31 17:35:19,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:19,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:35:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:35:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:19,672 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-31 17:35:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:19,932 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-31 17:35:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:35:19,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 17:35:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:19,933 INFO L225 Difference]: With dead ends: 115 [2019-01-31 17:35:19,934 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:35:19,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:35:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-31 17:35:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:35:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-31 17:35:20,045 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-31 17:35:20,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:20,045 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-31 17:35:20,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:35:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-31 17:35:20,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:20,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:20,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:20,046 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:20,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-31 17:35:20,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:20,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:20,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:20,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:20,463 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-31 17:35:20,657 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-31 17:35:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:20,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:20,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:20,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:20,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:20,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:20,810 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:20,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:20,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:20,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:20,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:20,844 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 15 treesize of output 18 [2019-01-31 17:35:20,847 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 18 treesize of output 24 [2019-01-31 17:35:20,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,854 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:20,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,859 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 22 treesize of output 45 [2019-01-31 17:35:20,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:20,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:20,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:20,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:20,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,915 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 31 treesize of output 40 [2019-01-31 17:35:20,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:20,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:20,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:20,974 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:20,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:20,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,010 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:21,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:21,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:21,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:21,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:21,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:35:21,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:21,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-31 17:35:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-31 17:35:21,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:21,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:35:21,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:21,250 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:21,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:35:21,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:21,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:21,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-31 17:35:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:21,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:21,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:21,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:35:21,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:21,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:35:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:35:21,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:21,365 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-31 17:35:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:21,913 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-31 17:35:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:21,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:35:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:21,915 INFO L225 Difference]: With dead ends: 104 [2019-01-31 17:35:21,915 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:35:21,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:35:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-31 17:35:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:35:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-31 17:35:22,021 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-31 17:35:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:22,022 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-31 17:35:22,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:35:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-31 17:35:22,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:22,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:22,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:22,023 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:22,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:22,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-31 17:35:22,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:22,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:22,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:22,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:22,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:22,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:22,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:22,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:22,090 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-31 17:35:22,094 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:22,094 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:22,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:22,682 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:35:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:22,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:22,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:22,682 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:22,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:22,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:22,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:22,706 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 15 treesize of output 18 [2019-01-31 17:35:22,713 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 18 treesize of output 20 [2019-01-31 17:35:22,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:35:22,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:35:22,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,810 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 26 treesize of output 25 [2019-01-31 17:35:22,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,824 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:35:22,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:35:22,854 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,862 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,887 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-01-31 17:35:22,887 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:35:22,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:35:22,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:22,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:35:22,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:35:22,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:22,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-31 17:35:22,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,982 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:22,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:22,984 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 55 [2019-01-31 17:35:22,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:22,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:22,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-31 17:35:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:23,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:23,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:23,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:23,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:23,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:23,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:23,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:23,070 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-31 17:35:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:23,466 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-31 17:35:23,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:23,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:35:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:23,467 INFO L225 Difference]: With dead ends: 68 [2019-01-31 17:35:23,467 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:35:23,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:35:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-31 17:35:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:35:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-31 17:35:23,568 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-31 17:35:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:23,569 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-31 17:35:23,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-31 17:35:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:23,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:23,569 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:35:23,569 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:23,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:23,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-31 17:35:23,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:23,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:23,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:23,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:23,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:35:23,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:35:23,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:35:23,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:23,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:23,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:23,633 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-31 17:35:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:23,751 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-31 17:35:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:23,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-31 17:35:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:23,752 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:35:23,753 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:35:23,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:35:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-31 17:35:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:35:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-31 17:35:23,839 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-31 17:35:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:23,839 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-31 17:35:23,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-31 17:35:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:23,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:23,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:23,840 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:23,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:23,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-31 17:35:23,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:23,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:23,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:23,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:23,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:23,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:23,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:23,922 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-31 17:35:23,923 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:23,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:24,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:24,543 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:35:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:24,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:24,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:24,544 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:24,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:24,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:24,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:24,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,586 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 31 treesize of output 40 [2019-01-31 17:35:24,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:24,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:24,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:35:24,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:24,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:24,721 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 22 treesize of output 45 [2019-01-31 17:35:24,722 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,858 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,874 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,892 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-01-31 17:35:24,893 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:24,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:24,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:24,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:24,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:24,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:24,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:35:24,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:24,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:24,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-31 17:35:25,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:25,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:35:25,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:25,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:25,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-31 17:35:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:25,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:25,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:25,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:35:25,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:25,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:25,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:25,128 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-31 17:35:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:25,611 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-31 17:35:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:35:25,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:35:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:25,613 INFO L225 Difference]: With dead ends: 78 [2019-01-31 17:35:25,613 INFO L226 Difference]: Without dead ends: 71 [2019-01-31 17:35:25,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-31 17:35:25,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-31 17:35:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:35:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-31 17:35:25,718 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-31 17:35:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:25,718 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-31 17:35:25,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-31 17:35:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:25,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:25,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:25,719 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:25,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:25,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-31 17:35:25,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:25,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:25,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:25,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:25,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:25,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:25,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:25,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:25,886 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-31 17:35:25,887 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:25,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:26,084 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:26,084 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:26,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:26,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:26,085 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:26,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:26,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:26,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,118 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 31 treesize of output 40 [2019-01-31 17:35:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:26,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:26,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:35:26,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:26,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:26,240 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 22 treesize of output 45 [2019-01-31 17:35:26,240 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,256 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,290 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-01-31 17:35:26,291 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:26,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:26,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:26,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:26,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:26,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:35:26,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:26,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:26,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:26,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:26,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:26,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:26,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:35:26,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:26,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:35:26,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:35:26,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:26,437 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-31 17:35:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:26,844 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-31 17:35:26,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:26,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:35:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:26,845 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:35:26,845 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:35:26,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:35:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-31 17:35:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-31 17:35:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-31 17:35:26,948 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-31 17:35:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:26,949 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-31 17:35:26,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:35:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-31 17:35:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:26,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:26,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:26,950 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:26,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-31 17:35:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:26,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:26,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:27,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:27,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:27,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:27,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:27,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:27,027 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:27,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:27,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:27,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:27,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:27,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:27,045 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 26 treesize of output 25 [2019-01-31 17:35:27,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,061 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:35:27,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:35:27,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,132 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,168 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 15 treesize of output 18 [2019-01-31 17:35:27,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:35:27,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:35:27,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:35:27,179 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,191 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,223 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-01-31 17:35:27,223 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-31 17:35:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:35:27,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:27,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 17:35:27,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:35:27,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:27,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-31 17:35:27,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:27,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:27,320 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 55 [2019-01-31 17:35:27,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:27,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:27,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-31 17:35:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:27,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:27,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:27,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:35:27,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:27,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:27,409 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-31 17:35:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:27,908 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-31 17:35:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:35:27,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:35:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:27,909 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:35:27,909 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:35:27,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:35:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-31 17:35:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:35:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-31 17:35:28,051 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-31 17:35:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:28,051 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-31 17:35:28,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-31 17:35:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:35:28,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:28,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:28,052 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:28,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-31 17:35:28,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:28,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:28,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:28,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:28,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:28,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:28,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:35:28,176 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-31 17:35:28,176 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:28,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:28,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:28,422 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:28,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:28,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:28,423 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:28,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:28,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:28,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:28,456 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 14 treesize of output 17 [2019-01-31 17:35:28,460 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 17 treesize of output 19 [2019-01-31 17:35:28,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,484 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 9 [2019-01-31 17:35:28,485 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,517 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 15 treesize of output 18 [2019-01-31 17:35:28,523 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 18 treesize of output 20 [2019-01-31 17:35:28,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:35:28,533 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:35:28,533 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,543 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,551 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,571 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-01-31 17:35:28,572 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-31 17:35:28,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,608 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 34 [2019-01-31 17:35:28,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:35:28,637 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-01-31 17:35:28,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-31 17:35:28,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,683 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:28,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:35:28,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:28,710 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 48 [2019-01-31 17:35:28,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:28,732 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-01-31 17:35:28,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-31 17:35:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:28,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:28,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:28,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-31 17:35:28,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:28,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:35:28,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:35:28,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:35:28,799 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-31 17:35:29,242 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-31 17:35:29,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:29,754 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-31 17:35:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:29,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:35:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:29,756 INFO L225 Difference]: With dead ends: 90 [2019-01-31 17:35:29,756 INFO L226 Difference]: Without dead ends: 77 [2019-01-31 17:35:29,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:35:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-31 17:35:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-31 17:35:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 17:35:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-31 17:35:29,959 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-31 17:35:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:29,960 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-31 17:35:29,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:35:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-31 17:35:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:35:29,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:29,960 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:29,960 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-31 17:35:29,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:29,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:29,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:29,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:29,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:30,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:30,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:30,132 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:35:30,133 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-31 17:35:30,134 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:30,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:30,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:30,630 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:30,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:30,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:30,631 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:30,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:30,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:30,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:30,666 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 15 treesize of output 18 [2019-01-31 17:35:30,671 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 18 treesize of output 24 [2019-01-31 17:35:30,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:30,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,697 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 22 treesize of output 45 [2019-01-31 17:35:30,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,755 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 31 treesize of output 40 [2019-01-31 17:35:30,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,782 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:30,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:30,817 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,826 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,835 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,854 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-01-31 17:35:30,854 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:30,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:30,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:30,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:35:30,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:30,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:30,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:30,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-31 17:35:30,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:30,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:30,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:31,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:31,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:31,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-31 17:35:31,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:31,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:35:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:35:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:35:31,062 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-31 17:35:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:31,760 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-31 17:35:31,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:35:31,761 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:35:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:31,762 INFO L225 Difference]: With dead ends: 118 [2019-01-31 17:35:31,762 INFO L226 Difference]: Without dead ends: 106 [2019-01-31 17:35:31,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-31 17:35:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-31 17:35:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 17:35:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-31 17:35:31,982 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-31 17:35:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:31,982 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-31 17:35:31,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:35:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-31 17:35:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:35:31,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:31,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:31,983 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:31,983 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-31 17:35:31,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:31,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:31,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:32,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:32,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:32,091 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:35:32,091 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-31 17:35:32,092 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:32,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:32,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:32,922 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:35:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:32,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:32,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:32,926 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:32,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:32,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:33,058 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 15 treesize of output 18 [2019-01-31 17:35:33,061 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 18 treesize of output 24 [2019-01-31 17:35:33,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,066 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:33,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,071 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 22 treesize of output 45 [2019-01-31 17:35:33,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,126 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 31 treesize of output 40 [2019-01-31 17:35:33,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,152 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:33,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:33,183 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,193 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,220 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:33,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:33,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:33,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:33,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:35:33,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:33,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:33,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,405 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:33,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:33,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:33,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:33,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,455 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:33,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:33,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:35:33,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:33,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:33,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-31 17:35:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:33,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:33,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:33,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:33,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:35:33,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:33,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:35:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:35:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:33,565 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-31 17:35:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:34,430 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-31 17:35:34,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:35:34,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-31 17:35:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:34,432 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:35:34,432 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:35:34,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:35:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:35:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-31 17:35:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:35:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-31 17:35:34,717 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-31 17:35:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:34,717 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-31 17:35:34,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:35:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-31 17:35:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:35:34,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:34,718 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:34,718 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:34,719 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-31 17:35:34,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:34,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:34,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:34,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:35:34,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:34,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:34,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:35:34,806 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-31 17:35:34,807 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:34,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:35,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:35,013 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:35:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:35,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:35,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:35,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:35,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:35,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:35,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:35,030 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 15 treesize of output 18 [2019-01-31 17:35:35,035 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 18 treesize of output 20 [2019-01-31 17:35:35,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-31 17:35:35,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,056 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 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-31 17:35:35,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,107 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 14 treesize of output 17 [2019-01-31 17:35:35,111 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 17 treesize of output 19 [2019-01-31 17:35:35,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,125 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 9 [2019-01-31 17:35:35,125 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,149 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-01-31 17:35:35,149 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-31 17:35:35,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,183 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 34 [2019-01-31 17:35:35,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:35:35,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-31 17:35:35,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-31 17:35:35,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,237 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 21 treesize of output 27 [2019-01-31 17:35:35,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,266 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-01-31 17:35:35,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,286 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 2 xjuncts. [2019-01-31 17:35:35,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-31 17:35:35,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,311 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 21 treesize of output 27 [2019-01-31 17:35:35,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:35,349 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 48 [2019-01-31 17:35:35,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:35,382 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-01-31 17:35:35,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-31 17:35:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:35,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:35,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:35:35,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:35,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:35:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:35:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:35:35,517 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-31 17:35:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:36,307 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-31 17:35:36,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:35:36,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:35:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:36,309 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:35:36,309 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:35:36,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:35:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-31 17:35:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:35:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-31 17:35:36,640 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-31 17:35:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:36,640 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-31 17:35:36,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:35:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-31 17:35:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:35:36,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:36,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:36,641 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-31 17:35:36,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:36,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:36,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:36,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:36,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:36,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:36,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:36,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:36,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:36,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:36,848 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:36,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:36,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:36,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:35:36,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:36,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:36,867 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 15 treesize of output 18 [2019-01-31 17:35:36,874 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 18 treesize of output 20 [2019-01-31 17:35:36,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,885 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-31 17:35:36,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-31 17:35:36,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,939 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 26 treesize of output 25 [2019-01-31 17:35:36,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,953 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-31 17:35:36,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:36,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:35:36,981 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,989 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:36,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,013 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-31 17:35:37,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:37,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:35:37,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-31 17:35:37,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-31 17:35:37,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-31 17:35:37,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,243 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:37,244 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 30 treesize of output 34 [2019-01-31 17:35:37,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,269 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-01-31 17:35:37,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-31 17:35:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,317 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:37,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-31 17:35:37,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,363 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 38 treesize of output 34 [2019-01-31 17:35:37,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,388 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-01-31 17:35:37,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-31 17:35:37,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,426 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-01-31 17:35:37,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:37,469 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:37,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-31 17:35:37,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:37,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-31 17:35:37,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-31 17:35:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:37,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:37,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:37,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-31 17:35:37,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:37,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:35:37,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:35:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:35:37,615 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-31 17:35:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:38,905 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-31 17:35:38,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:35:38,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-31 17:35:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:38,907 INFO L225 Difference]: With dead ends: 186 [2019-01-31 17:35:38,908 INFO L226 Difference]: Without dead ends: 177 [2019-01-31 17:35:38,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:35:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-31 17:35:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-31 17:35:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-31 17:35:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-31 17:35:39,335 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-31 17:35:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:39,335 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-31 17:35:39,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:35:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-31 17:35:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:35:39,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:39,336 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:39,336 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-31 17:35:39,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:39,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:39,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:39,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:35:39,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:39,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:39,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:35:39,466 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-31 17:35:39,467 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:39,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:40,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:35:40,079 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:35:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:40,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:35:40,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:40,079 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:40,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:40,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:35:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:40,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:40,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,126 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 31 treesize of output 40 [2019-01-31 17:35:40,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,162 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:40,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:40,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:35:40,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:40,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:40,234 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 22 treesize of output 45 [2019-01-31 17:35:40,234 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,248 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,257 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,284 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-01-31 17:35:40,285 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:40,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:40,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:40,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:40,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:35:40,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:40,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-31 17:35:40,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,402 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:40,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:40,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:40,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:40,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2019-01-31 17:35:40,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:40,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:40,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-31 17:35:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:40,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:40,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:35:40,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:40,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:35:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:35:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:35:40,668 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-31 17:35:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:41,520 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-31 17:35:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:41,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:35:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:41,526 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:35:41,526 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:35:41,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:35:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:35:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-31 17:35:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:35:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-31 17:35:41,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-31 17:35:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:41,640 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-31 17:35:41,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:35:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-31 17:35:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:35:41,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:41,640 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:35:41,641 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:41,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-31 17:35:41,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:41,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:41,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:41,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:41,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-31 17:35:41,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:41,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:41,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:41,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:41,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:41,770 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:35:41,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:35:41,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:35:41,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:35:41,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:41,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:41,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,807 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 31 treesize of output 40 [2019-01-31 17:35:41,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,837 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-31 17:35:41,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-31 17:35:41,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 [2019-01-31 17:35:41,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:41,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:41,913 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 22 treesize of output 45 [2019-01-31 17:35:41,913 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:41,963 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-31 17:35:41,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:41,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:35:41,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:42,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-31 17:35:42,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:35:42,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:42,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-31 17:35:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:42,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:35:42,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:42,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-31 17:35:42,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,144 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:35:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:35:42,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:42,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-31 17:35:42,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:42,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-01-31 17:35:42,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:42,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:42,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-31 17:35:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:42,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:42,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:35:42,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:42,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:35:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:35:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:35:42,365 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-31 17:35:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:42,855 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-31 17:35:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:35:42,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:35:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:42,856 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:35:42,856 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:35:42,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:35:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:35:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:35:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:35:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:35:42,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-31 17:35:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:42,858 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:35:42,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:35:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:35:42,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:35:42,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:35:42,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:42,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:42,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:42,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:43,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:43,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:43,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:43,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:43,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:43,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:44,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:44,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:44,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:44,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:48,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:48,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:49,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:49,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:49,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:49,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:52,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:35:56,046 WARN L181 SmtUtils]: Spent 13.18 s on a formula simplification. DAG size of input: 1499 DAG size of output: 1055 [2019-01-31 17:36:11,602 WARN L181 SmtUtils]: Spent 15.55 s on a formula simplification. DAG size of input: 993 DAG size of output: 79 [2019-01-31 17:36:11,605 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:36:11,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-31 17:36:11,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-31 17:36:11,606 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-31 17:36:11,606 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-31 17:36:11,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-31 17:36:11,606 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse5 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse11 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse21 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse5 (- 1)))) (.cse7 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse22 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse7 1))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse18 (select .cse21 ULTIMATE.start_main_p1)) (.cse19 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse11 1)))) (let ((.cse3 (<= (+ (select .cse19 ULTIMATE.start_main_p4) 1) 0)) (.cse9 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse1 (<= 1 .cse18)) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse14 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse6 (- 1)))) (.cse2 (= 0 (select .cse21 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse13 (= 0 (select .cse22 ULTIMATE.start_main_p1))) (.cse10 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse15 (= 0 (select .cse22 ULTIMATE.start_main_p2))) (.cse0 (select .cse21 ULTIMATE.start_main_p3))) (or (and (and (= 0 .cse0) .cse1 .cse2 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) .cse3) (and .cse4 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse5 0) (<= .cse6 0) (= .cse7 0) .cse8 .cse9 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse10 (<= 0 .cse11)) (and (and .cse12 .cse13 (= 0 (select .cse14 ULTIMATE.start_main_p3)) .cse15) .cse3) (and (<= .cse5 0) (or (and .cse9 (let ((.cse16 (<= 0 .cse7)) (.cse17 (<= (+ (select .cse19 ULTIMATE.start_main_p2) 1) 0))) (or (and .cse16 .cse1 .cse17) (and .cse16 .cse17 (= 0 .cse18) .cse8)))) (let ((.cse20 (<= 1 .cse0))) (or (and (<= 1 (select .cse14 ULTIMATE.start_main_p1)) .cse2 .cse20) (and .cse4 .cse12 .cse13 .cse10 .cse15 .cse20)))))))))) [2019-01-31 17:36:11,606 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:36:11,607 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-31 17:36:11,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-31 17:36:11,607 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-31 17:36:11,621 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:36:11 BoogieIcfgContainer [2019-01-31 17:36:11,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:36:11,622 INFO L168 Benchmark]: Toolchain (without parser) took 114613.04 ms. Allocated memory was 141.0 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 108.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-31 17:36:11,622 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:36:11,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.95 ms. Allocated memory is still 141.0 MB. Free memory was 108.4 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:36:11,623 INFO L168 Benchmark]: Boogie Preprocessor took 22.64 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 105.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:36:11,623 INFO L168 Benchmark]: RCFGBuilder took 425.40 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:36:11,624 INFO L168 Benchmark]: TraceAbstraction took 114107.30 ms. Allocated memory was 141.0 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 94.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-31 17:36:11,625 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.21 ms. Allocated memory is still 141.0 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.95 ms. Allocated memory is still 141.0 MB. Free memory was 108.4 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.64 ms. Allocated memory is still 141.0 MB. Free memory was 106.3 MB in the beginning and 105.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 425.40 ms. Allocated memory is still 141.0 MB. Free memory was 105.0 MB in the beginning and 94.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114107.30 ms. Allocated memory was 141.0 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 94.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || (((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1])) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (#memory_int[p4] <= 0 && ((!(p3 == p4) && (((0 <= #memory_int[p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || (((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)))) || ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) || (((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 114.0s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 28.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 23.6s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 326 HoareAnnotationTreeSize, 1 FomulaSimplifications, 3998314872 FormulaSimplificationTreeSizeReduction, 13.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 84173104 FormulaSimplificationTreeSizeReductionInter, 15.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 31.2s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91495 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...