java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:10:03,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:10:03,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:10:03,928 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:10:03,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:10:03,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:10:03,933 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:10:03,935 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:10:03,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:10:03,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:10:03,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:10:03,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:10:03,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:10:03,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:10:03,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:10:03,942 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:10:03,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:10:03,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:10:03,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:10:03,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:10:03,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:10:03,951 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:10:03,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:10:03,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:10:03,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:10:03,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:10:03,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:10:03,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:10:03,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:10:03,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:10:03,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:10:03,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:10:03,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:10:03,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:10:03,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:10:03,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:10:03,961 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 10:10:03,981 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:10:03,982 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:10:03,983 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:10:03,983 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:10:03,983 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:10:03,983 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:10:03,983 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:10:03,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:10:03,984 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:10:03,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:10:03,984 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:10:03,984 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:10:03,985 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:10:03,985 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:10:03,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:10:03,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:10:03,986 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:10:03,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:10:03,986 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:10:03,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:10:03,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:10:03,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:10:03,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:10:03,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:10:03,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:10:03,988 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:10:03,988 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:10:03,988 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:10:03,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:10:03,989 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:10:03,989 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:10:03,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:10:03,989 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:10:03,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:10:03,990 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:10:03,990 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:10:03,990 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:10:03,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:10:03,990 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:10:03,991 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:10:04,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:10:04,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:10:04,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:10:04,039 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:10:04,040 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:10:04,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-01-20 10:10:04,041 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-01-20 10:10:04,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:10:04,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:10:04,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:10:04,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:10:04,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:10:04,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:10:04,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:10:04,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:10:04,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:10:04,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... [2019-01-20 10:10:04,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:10:04,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:10:04,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:10:04,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:10:04,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:10:04,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:10:04,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:10:04,708 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:10:04,708 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-20 10:10:04,710 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:10:04 BoogieIcfgContainer [2019-01-20 10:10:04,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:10:04,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:10:04,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:10:04,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:10:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:04" (1/2) ... [2019-01-20 10:10:04,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2638b65f and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:10:04, skipping insertion in model container [2019-01-20 10:10:04,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:10:04" (2/2) ... [2019-01-20 10:10:04,718 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-01-20 10:10:04,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:10:04,732 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-20 10:10:04,748 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-20 10:10:04,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:10:04,779 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:10:04,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:10:04,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:10:04,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:10:04,780 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:10:04,780 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:10:04,780 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:10:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-20 10:10:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:10:04,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:04,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:10:04,803 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:04,809 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-01-20 10:10:04,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:04,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:05,008 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-20 10:10:05,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:05,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:10:05,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:05,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:10:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:10:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:10:05,032 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-20 10:10:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:05,234 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-20 10:10:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:05,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:10:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:05,251 INFO L225 Difference]: With dead ends: 33 [2019-01-20 10:10:05,251 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:10:05,254 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-20 10:10:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:10:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-01-20 10:10:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:10:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-01-20 10:10:05,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-01-20 10:10:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:05,288 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-01-20 10:10:05,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:10:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-01-20 10:10:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:05,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:05,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:05,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-01-20 10:10:05,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:05,374 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-20 10:10:05,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:10:05,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:05,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:10:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:10:05,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:10:05,377 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-01-20 10:10:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:05,604 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-20 10:10:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:05,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:10:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:05,609 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:10:05,609 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:10:05,611 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-20 10:10:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:10:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-20 10:10:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:10:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-01-20 10:10:05,619 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-01-20 10:10:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:05,620 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-01-20 10:10:05,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:10:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-01-20 10:10:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:05,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:05,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:05,621 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-01-20 10:10:05,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:05,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:05,855 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-20 10:10:05,869 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-20 10:10:05,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:05,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:05,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:05,872 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-01-20 10:10:05,906 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:05,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:05,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:05,990 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:05,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:05,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:05,998 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-20 10:10:06,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:06,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:06,503 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-20 10:10:06,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,540 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 26 treesize of output 38 [2019-01-20 10:10:06,553 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 34 treesize of output 29 [2019-01-20 10:10:06,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,614 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 25 treesize of output 39 [2019-01-20 10:10:06,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,709 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-20 10:10:06,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:06,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,800 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,886 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 24 treesize of output 27 [2019-01-20 10:10:06,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,909 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 27 treesize of output 33 [2019-01-20 10:10:06,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,922 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 29 treesize of output 43 [2019-01-20 10:10:06,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:06,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:07,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,083 INFO L303 Elim1Store]: Index analysis took 125 ms [2019-01-20 10:10:07,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:07,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:10:07,122 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,510 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,593 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,623 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,645 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,667 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,683 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,718 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 1 xjuncts. [2019-01-20 10:10:07,719 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-01-20 10:10:07,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:10:07,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:08,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-20 10:10:09,352 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-20 10:10:09,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:09,366 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-20 10:10:09,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:09,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:09,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:09,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:09,387 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-01-20 10:10:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:29,515 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-01-20 10:10:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:29,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:29,518 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:10:29,518 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:10:29,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:10:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:10:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-01-20 10:10:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:10:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-01-20 10:10:29,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-01-20 10:10:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:29,525 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-01-20 10:10:29,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-20 10:10:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:29,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:29,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:29,527 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-01-20 10:10:29,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:29,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:29,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:29,610 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-20 10:10:29,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:29,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:29,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:29,611 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-01-20 10:10:29,613 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:29,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:29,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:29,623 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:29,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:29,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:29,624 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-20 10:10:29,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:29,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:29,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:29,736 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 24 treesize of output 27 [2019-01-20 10:10:29,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:29,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,808 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 29 treesize of output 43 [2019-01-20 10:10:29,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:29,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:29,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:29,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:29,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:10:29,983 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,060 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,101 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,269 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 26 treesize of output 38 [2019-01-20 10:10:30,292 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 34 treesize of output 29 [2019-01-20 10:10:30,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,353 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 25 treesize of output 39 [2019-01-20 10:10:30,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,398 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-20 10:10:30,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:30,437 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,441 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,443 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,445 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,448 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,479 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-01-20 10:10:30,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,615 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-20 10:10:30,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-20 10:10:30,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-20 10:10:30,733 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-20 10:10:30,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:30,816 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-20 10:10:30,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:10:30,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:10:30,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:30,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:30,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:30,837 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-01-20 10:10:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:30,933 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-01-20 10:10:30,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:30,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:10:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:30,935 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:10:30,935 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:10:30,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:30,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:10:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-20 10:10:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:10:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-20 10:10:30,944 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-01-20 10:10:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:30,944 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-20 10:10:30,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-20 10:10:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:30,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:30,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:30,945 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:30,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-01-20 10:10:30,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:30,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:30,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:30,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:31,024 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-20 10:10:31,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:31,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:31,025 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:31,025 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-01-20 10:10:31,027 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:31,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:31,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:31,037 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:31,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:31,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:31,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 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-20 10:10:31,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:31,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:31,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:31,182 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-20 10:10:31,185 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 24 treesize of output 27 [2019-01-20 10:10:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,192 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 27 treesize of output 33 [2019-01-20 10:10:31,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,202 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 29 treesize of output 43 [2019-01-20 10:10:31,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:31,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:31,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,367 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-20 10:10:31,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:31,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:10:31,387 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,557 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,638 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,758 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 37 treesize of output 46 [2019-01-20 10:10:31,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,793 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 33 treesize of output 48 [2019-01-20 10:10:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-01-20 10:10:31,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:10:31,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:31,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:31,892 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,911 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,913 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,915 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:31,946 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 1 xjuncts. [2019-01-20 10:10:31,947 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-20 10:10:32,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:32,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-20 10:10:32,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:32,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:32,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-20 10:10:33,334 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-20 10:10:33,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:33,345 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-20 10:10:33,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:33,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:33,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:33,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:33,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:33,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:33,367 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-01-20 10:10:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:52,367 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-01-20 10:10:52,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:52,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:52,368 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:10:52,369 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:10:52,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:10:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:10:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-01-20 10:10:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:10:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-01-20 10:10:52,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-01-20 10:10:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:52,376 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-01-20 10:10:52,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-01-20 10:10:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:52,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:52,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:52,378 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-01-20 10:10:52,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:52,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:52,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:52,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:52,491 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-20 10:10:52,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:52,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:52,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:52,492 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-01-20 10:10:52,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:52,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:52,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:52,501 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:52,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:52,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:52,502 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-20 10:10:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:52,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:52,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:52,615 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 24 treesize of output 27 [2019-01-20 10:10:52,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,621 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 27 treesize of output 33 [2019-01-20 10:10:52,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,627 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 29 treesize of output 43 [2019-01-20 10:10:52,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:52,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:52,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:52,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:10:52,692 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,773 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,852 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:52,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-20 10:10:52,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,986 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 33 treesize of output 48 [2019-01-20 10:10:52,993 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 36 treesize of output 45 [2019-01-20 10:10:52,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:52,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:10:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:53,076 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,078 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,080 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,085 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,114 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 1 xjuncts. [2019-01-20 10:10:53,115 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-20 10:10:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:53,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-20 10:10:53,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:53,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:53,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-20 10:10:54,449 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-20 10:10:54,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:54,462 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-20 10:10:54,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:54,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:54,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:54,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:54,482 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-01-20 10:11:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:13,010 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-01-20 10:11:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:11:13,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:11:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:13,012 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:11:13,012 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:11:13,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:11:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:11:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-20 10:11:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:11:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-01-20 10:11:13,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-01-20 10:11:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:13,021 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-01-20 10:11:13,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:11:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-01-20 10:11:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:13,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:13,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:13,022 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:13,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:13,023 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-01-20 10:11:13,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:13,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:13,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:13,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:13,073 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-20 10:11:13,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:11:13,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:11:13,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:11:13,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:11:13,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:11:13,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:11:13,074 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-01-20 10:11:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:13,131 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-01-20 10:11:13,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:11:13,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:11:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:13,133 INFO L225 Difference]: With dead ends: 33 [2019-01-20 10:11:13,133 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 10:11:13,134 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-20 10:11:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 10:11:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-20 10:11:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:11:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-01-20 10:11:13,141 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-01-20 10:11:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:13,141 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-01-20 10:11:13,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:11:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-01-20 10:11:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:13,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:13,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:13,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-01-20 10:11:13,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:13,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:13,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:13,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:13,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:13,194 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-20 10:11:13,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:13,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:13,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:11:13,195 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-01-20 10:11:13,196 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:13,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:13,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:13,207 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:13,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:13,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:13,208 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-20 10:11:13,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:13,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:13,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:13,231 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 20 treesize of output 23 [2019-01-20 10:11:13,237 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 23 treesize of output 25 [2019-01-20 10:11:13,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:11:13,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,264 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2019-01-20 10:11:13,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-01-20 10:11:13,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,356 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 24 treesize of output 27 [2019-01-20 10:11:13,360 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 27 treesize of output 29 [2019-01-20 10:11:13,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,374 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 29 treesize of output 35 [2019-01-20 10:11:13,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,384 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 31 treesize of output 45 [2019-01-20 10:11:13,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:11:13,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-20 10:11:13,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 100 [2019-01-20 10:11:13,489 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,548 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,580 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,603 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,622 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,639 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,658 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:13,693 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 1 xjuncts. [2019-01-20 10:11:13,693 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-01-20 10:11:13,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:13,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 104 [2019-01-20 10:11:13,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:13,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:13,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-01-20 10:11:15,504 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-01-20 10:11:15,509 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-20 10:11:15,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:15,561 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-20 10:11:15,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:11:15,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:11:15,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:11:15,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:11:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:11:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:11:15,582 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-01-20 10:11:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:15,643 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-01-20 10:11:15,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:11:15,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:11:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:15,645 INFO L225 Difference]: With dead ends: 33 [2019-01-20 10:11:15,645 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 10:11:15,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:11:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 10:11:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-20 10:11:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:11:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-01-20 10:11:15,653 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-01-20 10:11:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:15,653 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-01-20 10:11:15,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:11:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-01-20 10:11:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:15,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:15,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:15,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-01-20 10:11:15,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:15,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:15,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:15,761 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-20 10:11:15,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:15,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:15,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:11:15,762 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-01-20 10:11:15,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:15,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:15,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:15,772 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:15,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:15,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:15,772 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-20 10:11:15,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:15,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:15,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:15,856 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 24 treesize of output 27 [2019-01-20 10:11:15,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,861 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 27 treesize of output 33 [2019-01-20 10:11:15,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,869 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 29 treesize of output 43 [2019-01-20 10:11:15,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:15,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:15,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:15,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:15,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:11:15,924 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:15,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,228 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 26 treesize of output 38 [2019-01-20 10:11:16,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-01-20 10:11:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,253 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 25 treesize of output 39 [2019-01-20 10:11:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,260 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-20 10:11:16,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:16,298 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,301 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,303 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,305 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,308 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:16,337 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-20 10:11:16,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:11:16,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:16,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-20 10:11:16,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:16,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 134 [2019-01-20 10:11:16,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:16,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:16,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-20 10:11:19,080 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-20 10:11:19,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:19,110 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-20 10:11:19,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:19,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:19,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:19,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:19,132 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-01-20 10:11:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:54,963 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2019-01-20 10:11:54,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:54,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:11:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:54,965 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:11:54,966 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:11:54,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:54,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:11:54,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-01-20 10:11:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:11:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-01-20 10:11:54,974 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-01-20 10:11:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:54,974 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-01-20 10:11:54,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-01-20 10:11:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:54,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:54,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:54,975 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:54,976 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-01-20 10:11:54,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:54,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:54,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:54,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:55,064 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-20 10:11:55,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:55,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:55,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:11:55,065 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-01-20 10:11:55,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:55,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:55,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:55,072 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:55,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:55,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:55,072 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-20 10:11:55,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:55,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:55,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:55,158 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 24 treesize of output 27 [2019-01-20 10:11:55,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,163 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 27 treesize of output 33 [2019-01-20 10:11:55,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,170 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 29 treesize of output 43 [2019-01-20 10:11:55,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,182 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:55,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:55,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:55,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:11:55,230 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,291 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,473 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 40 treesize of output 49 [2019-01-20 10:11:55,475 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 45 treesize of output 37 [2019-01-20 10:11:55,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 64 [2019-01-20 10:11:55,506 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 59 [2019-01-20 10:11:55,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:55,564 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,566 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,568 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,570 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,572 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:55,603 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:85, output treesize:54 [2019-01-20 10:11:55,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:11:55,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:55,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-20 10:11:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,996 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:55,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-01-20 10:11:55,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-01-20 10:11:58,984 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-20 10:11:58,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:59,010 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-20 10:11:59,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:59,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:59,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:59,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:59,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:59,033 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-01-20 10:12:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:36,070 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-01-20 10:12:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:12:36,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:12:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:36,072 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:12:36,072 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:12:36,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:12:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:12:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-20 10:12:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:12:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-01-20 10:12:36,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-01-20 10:12:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:36,082 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-01-20 10:12:36,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:12:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-01-20 10:12:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:12:36,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:36,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:12:36,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-01-20 10:12:36,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:36,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:36,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:36,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:36,196 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-20 10:12:36,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:36,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:36,196 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:12:36,197 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-01-20 10:12:36,198 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:36,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:36,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:36,205 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:12:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:36,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:36,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:36,205 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-20 10:12:36,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:36,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:36,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:36,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,306 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 37 treesize of output 46 [2019-01-20 10:12:36,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,346 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 33 treesize of output 48 [2019-01-20 10:12:36,350 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 36 treesize of output 45 [2019-01-20 10:12:36,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:12:36,578 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-20 10:12:36,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:36,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,614 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 24 treesize of output 27 [2019-01-20 10:12:36,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,619 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 27 treesize of output 33 [2019-01-20 10:12:36,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,622 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 29 treesize of output 43 [2019-01-20 10:12:36,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,636 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:12:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:12:36,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:12:36,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:12:36,717 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,778 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,810 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,836 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,873 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,886 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:36,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:36,917 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2019-01-20 10:12:36,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:36,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:12:36,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:37,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:37,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-20 10:12:37,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:37,158 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:37,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-01-20 10:12:37,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:37,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:37,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-01-20 10:12:39,517 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-20 10:12:39,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:39,541 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-20 10:12:39,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:39,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:12:39,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:39,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:12:39,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:12:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:12:39,561 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-01-20 10:13:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:13,415 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-01-20 10:13:13,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:13:13,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:13:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:13,417 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:13:13,417 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:13:13,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:13,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:13:13,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-01-20 10:13:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:13:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 138 transitions. [2019-01-20 10:13:13,426 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 138 transitions. Word has length 4 [2019-01-20 10:13:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:13,426 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 138 transitions. [2019-01-20 10:13:13,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:13:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 138 transitions. [2019-01-20 10:13:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:13:13,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:13,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:13:13,428 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:13,428 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-01-20 10:13:13,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:13,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:13,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:13,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:13,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:13,540 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-20 10:13:13,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:13,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:13,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:13:13,540 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-01-20 10:13:13,541 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:13,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:13,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:13,547 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:13:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:13,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:13,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:13,548 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-20 10:13:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:13,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:13,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:13,683 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-20 10:13:13,685 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 24 treesize of output 27 [2019-01-20 10:13:13,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,691 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 27 treesize of output 33 [2019-01-20 10:13:13,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,696 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 29 treesize of output 43 [2019-01-20 10:13:13,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:13:13,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:13:13,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:13:13,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:13:13,764 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,820 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:13,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:13,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 26 treesize of output 38 [2019-01-20 10:13:14,000 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 34 treesize of output 29 [2019-01-20 10:13:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,005 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 25 treesize of output 39 [2019-01-20 10:13:14,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,012 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-20 10:13:14,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:13:14,043 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,045 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,046 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,048 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,052 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:14,078 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-20 10:13:14,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:13:14,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:14,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-20 10:13:14,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:14,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-01-20 10:13:14,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:14,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:14,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-20 10:13:16,875 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-20 10:13:16,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:16,911 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-20 10:13:16,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:16,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:13:16,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:16,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:13:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:13:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:13:16,930 INFO L87 Difference]: Start difference. First operand 37 states and 138 transitions. Second operand 8 states. [2019-01-20 10:13:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:49,408 INFO L93 Difference]: Finished difference Result 74 states and 200 transitions. [2019-01-20 10:13:49,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:13:49,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:13:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:49,409 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:13:49,409 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:13:49,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:13:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-01-20 10:13:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:13:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2019-01-20 10:13:49,419 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 4 [2019-01-20 10:13:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:49,420 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 155 transitions. [2019-01-20 10:13:49,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:13:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 155 transitions. [2019-01-20 10:13:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:13:49,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:49,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:13:49,421 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash 941284, now seen corresponding path program 1 times [2019-01-20 10:13:49,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:49,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:49,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:49,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:49,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-20 10:13:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:49,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:49,488 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:13:49,488 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [31] [2019-01-20 10:13:49,490 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:49,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:49,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:49,497 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:13:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:49,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:49,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:49,498 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-20 10:13:49,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:49,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:49,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:49,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-20 10:13:49,602 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 34 treesize of output 29 [2019-01-20 10:13:49,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,607 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 25 treesize of output 39 [2019-01-20 10:13:49,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,613 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-20 10:13:49,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:13:49,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,645 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:13:49,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,674 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 27 treesize of output 33 [2019-01-20 10:13:49,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,695 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 29 treesize of output 43 [2019-01-20 10:13:49,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,705 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:13:49,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:13:49,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:13:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:49,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:13:49,826 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,879 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,909 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,933 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,952 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,967 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:49,981 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:50,009 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-20 10:13:50,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:13:50,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:50,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-20 10:13:50,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:50,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-01-20 10:13:50,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:50,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:50,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-20 10:13:52,583 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-20 10:13:52,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:52,664 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-20 10:13:52,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:52,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:13:52,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:52,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:13:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:13:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:13:52,684 INFO L87 Difference]: Start difference. First operand 35 states and 155 transitions. Second operand 8 states. [2019-01-20 10:14:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:06,695 INFO L93 Difference]: Finished difference Result 67 states and 213 transitions. [2019-01-20 10:14:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:14:06,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:14:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:06,696 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:14:06,696 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:14:06,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:14:06,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:14:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-01-20 10:14:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:14:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2019-01-20 10:14:06,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 178 transitions. Word has length 4 [2019-01-20 10:14:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:06,705 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 178 transitions. [2019-01-20 10:14:06,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:14:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 178 transitions. [2019-01-20 10:14:06,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:14:06,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:06,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:14:06,706 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:06,706 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-01-20 10:14:06,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:06,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:06,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:06,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:06,763 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-20 10:14:06,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:06,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:06,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:14:06,764 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [33] [2019-01-20 10:14:06,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:14:06,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:14:06,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:14:06,770 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:14:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:06,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:14:06,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:06,771 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-20 10:14:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:06,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:14:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:06,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:06,836 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 24 treesize of output 27 [2019-01-20 10:14:06,839 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 27 treesize of output 33 [2019-01-20 10:14:06,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,845 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 29 treesize of output 39 [2019-01-20 10:14:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,853 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 31 treesize of output 49 [2019-01-20 10:14:06,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-01-20 10:14:06,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 85 [2019-01-20 10:14:06,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:06,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 104 [2019-01-20 10:14:06,899 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:06,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:06,990 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,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 26 treesize of output 38 [2019-01-20 10:14:07,105 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 34 treesize of output 29 [2019-01-20 10:14:07,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,110 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 25 treesize of output 35 [2019-01-20 10:14:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,125 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 45 [2019-01-20 10:14:07,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2019-01-20 10:14:07,155 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,167 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,232 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,235 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:07,270 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 1 xjuncts. [2019-01-20 10:14:07,271 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:68, output treesize:59 [2019-01-20 10:14:07,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:07,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:14:07,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:14:07,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 26 dim-0 vars, and 5 xjuncts. [2019-01-20 10:14:07,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:236 [2019-01-20 10:14:13,383 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-20 10:14:13,584 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:13,586 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-20 10:14:13,592 INFO L168 Benchmark]: Toolchain (without parser) took 249514.16 ms. Allocated memory was 137.9 MB in the beginning and 300.4 MB in the end (delta: 162.5 MB). Free memory was 104.9 MB in the beginning and 107.1 MB in the end (delta: -2.2 MB). Peak memory consumption was 160.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:14:13,592 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory is still 106.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:14:13,593 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.76 ms. Allocated memory is still 137.9 MB. Free memory was 104.9 MB in the beginning and 102.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:14:13,593 INFO L168 Benchmark]: Boogie Preprocessor took 24.59 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 101.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:14:13,593 INFO L168 Benchmark]: RCFGBuilder took 546.38 ms. Allocated memory is still 137.9 MB. Free memory was 101.5 MB in the beginning and 88.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-01-20 10:14:13,593 INFO L168 Benchmark]: TraceAbstraction took 248880.18 ms. Allocated memory was 137.9 MB in the beginning and 300.4 MB in the end (delta: 162.5 MB). Free memory was 88.7 MB in the beginning and 107.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 144.2 MB. Max. memory is 7.1 GB. [2019-01-20 10:14:13,595 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.18 ms. Allocated memory is still 137.9 MB. Free memory is still 106.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.76 ms. Allocated memory is still 137.9 MB. Free memory was 104.9 MB in the beginning and 102.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.59 ms. Allocated memory is still 137.9 MB. Free memory was 102.8 MB in the beginning and 101.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 546.38 ms. Allocated memory is still 137.9 MB. Free memory was 101.5 MB in the beginning and 88.7 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248880.18 ms. Allocated memory was 137.9 MB in the beginning and 300.4 MB in the end (delta: 162.5 MB). Free memory was 88.7 MB in the beginning and 107.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 144.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...