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-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:38:41,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:38:41,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:38:41,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:38:41,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:38:41,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:38:41,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:38:41,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:38:41,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:38:41,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:38:41,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:38:41,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:38:41,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:38:41,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:38:41,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:38:41,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:38:41,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:38:41,885 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:38:41,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:38:41,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:38:41,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:38:41,891 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:38:41,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:38:41,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:38:41,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:38:41,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:38:41,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:38:41,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:38:41,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:38:41,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:38:41,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:38:41,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:38:41,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:38:41,901 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:38:41,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:38:41,902 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:38:41,903 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-18 09:38:41,925 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:38:41,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:38:41,927 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:38:41,927 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:38:41,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:38:41,927 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:38:41,928 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:38:41,928 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:38:41,928 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:38:41,928 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:38:41,928 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:38:41,929 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:38:41,932 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:38:41,932 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:38:41,933 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:38:41,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:38:41,933 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:38:41,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:38:41,934 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:38:41,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:38:41,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:38:41,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:38:41,934 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:38:41,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:38:41,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:38:41,936 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:38:41,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:38:41,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:38:41,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:38:41,937 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:38:41,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:38:41,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:41,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:38:41,938 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:38:41,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:38:41,939 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:38:41,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:38:41,939 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:38:41,939 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:38:41,939 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:38:41,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:38:41,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:38:41,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:38:41,991 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:38:41,991 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:38:41,992 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-02-18 09:38:41,992 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-02-18 09:38:42,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:38:42,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:38:42,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:42,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:38:42,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:38:42,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:42,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:38:42,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:38:42,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:38:42,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... [2019-02-18 09:38:42,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:38:42,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:38:42,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:38:42,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:38:42,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:42,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:38:42,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:38:42,516 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:38:42,517 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-18 09:38:42,518 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:42 BoogieIcfgContainer [2019-02-18 09:38:42,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:38:42,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:38:42,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:38:42,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:38:42,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:42" (1/2) ... [2019-02-18 09:38:42,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470aa750 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:38:42, skipping insertion in model container [2019-02-18 09:38:42,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:42" (2/2) ... [2019-02-18 09:38:42,527 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-02-18 09:38:42,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:38:42,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-18 09:38:42,582 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-18 09:38:42,632 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:38:42,632 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:38:42,633 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:38:42,633 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:38:42,633 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:38:42,633 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:38:42,633 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:38:42,634 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:38:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-18 09:38:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:38:42,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:42,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:38:42,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-18 09:38:42,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:42,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:42,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:42,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:42,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:42,878 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-18 09:38:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:43,055 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-18 09:38:43,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:43,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:38:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:43,074 INFO L225 Difference]: With dead ends: 29 [2019-02-18 09:38:43,075 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:38:43,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:38:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-18 09:38:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:38:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-18 09:38:43,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-18 09:38:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:43,132 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-18 09:38:43,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-18 09:38:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:43,133 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:43,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:43,134 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:43,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,134 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-18 09:38:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:43,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:43,337 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-18 09:38:43,374 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:43,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:43,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:43,458 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-02-18 09:38:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:43,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:43,724 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-02-18 09:38:43,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:38:43,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,784 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 21 treesize of output 24 [2019-02-18 09:38:43,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-02-18 09:38:43,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,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 26 treesize of output 40 [2019-02-18 09:38:43,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,891 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 28 treesize of output 54 [2019-02-18 09:38:43,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,006 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-02-18 09:38:44,008 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 30 treesize of output 72 [2019-02-18 09:38:44,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,038 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:38:44,040 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,260 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,520 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-02-18 09:38:44,521 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-18 09:38:44,694 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-02-18 09:38:44,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,888 INFO L303 Elim1Store]: Index analysis took 173 ms [2019-02-18 09:38:44,891 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 41 treesize of output 91 [2019-02-18 09:38:44,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,031 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-02-18 09:38:45,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-18 09:38:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:45,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:45,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:45,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:45,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:45,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:45,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:45,165 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-18 09:38:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:47,012 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-18 09:38:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:47,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:47,014 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:38:47,014 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:38:47,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:38:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-18 09:38:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:38:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-18 09:38:47,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-18 09:38:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:47,022 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-18 09:38:47,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:47,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-18 09:38:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:47,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:47,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:47,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-18 09:38:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:47,079 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:47,079 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-18 09:38:47,083 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:47,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:47,093 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:47,093 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-02-18 09:38:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:47,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:47,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-18 09:38:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,180 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 24 treesize of output 30 [2019-02-18 09:38:47,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,198 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 26 treesize of output 40 [2019-02-18 09:38:47,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,224 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 28 treesize of output 54 [2019-02-18 09:38:47,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,248 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 30 treesize of output 72 [2019-02-18 09:38:47,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,297 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:38:47,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,395 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:38:47,570 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,598 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-02-18 09:38:47,598 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-02-18 09:38:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,658 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 41 treesize of output 97 [2019-02-18 09:38:47,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,771 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-02-18 09:38:47,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-18 09:38:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:47,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:38:47,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:47,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:47,817 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-18 09:38:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:47,891 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-18 09:38:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:38:47,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:38:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:47,892 INFO L225 Difference]: With dead ends: 23 [2019-02-18 09:38:47,892 INFO L226 Difference]: Without dead ends: 22 [2019-02-18 09:38:47,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-18 09:38:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-18 09:38:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:38:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-18 09:38:47,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-18 09:38:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:47,900 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-18 09:38:47,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-18 09:38:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:47,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:47,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:47,902 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:47,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-18 09:38:47,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:47,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:47,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:47,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:47,992 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-18 09:38:47,995 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:47,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:48,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:48,005 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-02-18 09:38:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:48,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:48,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:48,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:38:48,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,102 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 21 treesize of output 24 [2019-02-18 09:38:48,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,109 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 24 treesize of output 30 [2019-02-18 09:38:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,141 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 26 treesize of output 40 [2019-02-18 09:38:48,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,186 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 28 treesize of output 54 [2019-02-18 09:38:48,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,220 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 30 treesize of output 72 [2019-02-18 09:38:48,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,255 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:38:48,256 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,304 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,421 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-02-18 09:38:48,422 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-18 09:38:48,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,530 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 41 treesize of output 97 [2019-02-18 09:38:48,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,595 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-02-18 09:38:48,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-18 09:38:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:48,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:48,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:48,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:48,708 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-18 09:38:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:50,173 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-02-18 09:38:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:50,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:50,175 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:38:50,175 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:38:50,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:38:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-02-18 09:38:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:38:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-02-18 09:38:50,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-02-18 09:38:50,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:50,183 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-02-18 09:38:50,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-02-18 09:38:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:50,183 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:50,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:50,184 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-18 09:38:50,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:50,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:50,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:50,302 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:50,302 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-18 09:38:50,305 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:50,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:50,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:50,313 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-02-18 09:38:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:50,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:50,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:50,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:50,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:50,433 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 21 treesize of output 24 [2019-02-18 09:38:50,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,438 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 24 treesize of output 30 [2019-02-18 09:38:50,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,447 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 26 treesize of output 40 [2019-02-18 09:38:50,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-18 09:38:50,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,564 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-02-18 09:38:50,565 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 30 treesize of output 72 [2019-02-18 09:38:50,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,579 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:38:50,580 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,624 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,664 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:38:50,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,825 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-02-18 09:38:50,825 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-18 09:38:50,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,915 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 41 treesize of output 97 [2019-02-18 09:38:50,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,029 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-02-18 09:38:51,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-18 09:38:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:51,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:51,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:51,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:51,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:51,179 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-02-18 09:38:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:52,173 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-02-18 09:38:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:52,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:52,176 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:38:52,177 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:38:52,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:38:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-18 09:38:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:38:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-02-18 09:38:52,187 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-02-18 09:38:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:52,187 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-02-18 09:38:52,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-02-18 09:38:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:52,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:52,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:52,188 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-18 09:38:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:52,323 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:52,324 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-18 09:38:52,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:52,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:52,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:52,332 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:38:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:52,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:52,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:52,404 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 21 treesize of output 24 [2019-02-18 09:38:52,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,408 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 24 treesize of output 30 [2019-02-18 09:38:52,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,420 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 26 treesize of output 40 [2019-02-18 09:38:52,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-18 09:38:52,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,568 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-02-18 09:38:52,570 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 30 treesize of output 72 [2019-02-18 09:38:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,588 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:38:52,589 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,968 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:38:53,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:53,088 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-18 09:38:53,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,141 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 41 treesize of output 91 [2019-02-18 09:38:53,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:53,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-18 09:38:53,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-02-18 09:38:53,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,330 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-02-18 09:38:53,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-02-18 09:38:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:53,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:53,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:53,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:53,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:53,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:53,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:53,544 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-02-18 09:38:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:56,413 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-02-18 09:38:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:56,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:56,415 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:38:56,415 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:38:56,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:38:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-02-18 09:38:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:38:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-02-18 09:38:56,426 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-02-18 09:38:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:56,427 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-02-18 09:38:56,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-02-18 09:38:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:56,427 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:56,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:56,428 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-18 09:38:56,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:56,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:56,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:56,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:56,530 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-18 09:38:56,531 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:56,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:56,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:56,539 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:38:56,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:56,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:56,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:56,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:38:56,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,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 21 treesize of output 24 [2019-02-18 09:38:56,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,622 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 24 treesize of output 30 [2019-02-18 09:38:56,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,629 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 26 treesize of output 40 [2019-02-18 09:38:56,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,639 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 28 treesize of output 54 [2019-02-18 09:38:56,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,652 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 30 treesize of output 72 [2019-02-18 09:38:56,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,663 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:38:56,664 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,790 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-18 09:38:56,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,835 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 41 treesize of output 91 [2019-02-18 09:38:56,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-18 09:38:56,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,947 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:56,948 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 43 treesize of output 106 [2019-02-18 09:38:56,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,021 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-02-18 09:38:57,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-02-18 09:38:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:57,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:57,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:57,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:57,272 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-02-18 09:38:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:59,978 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-02-18 09:38:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:59,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:59,980 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:38:59,980 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:38:59,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:38:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-02-18 09:38:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:38:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-18 09:38:59,990 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-18 09:38:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:59,990 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-18 09:38:59,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-18 09:38:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:59,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:59,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:59,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-18 09:38:59,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,134 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-02-18 09:39:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:00,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:39:00,162 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-18 09:39:00,163 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:00,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:00,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:00,170 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:39:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:00,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:00,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:00,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:00,242 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 21 treesize of output 24 [2019-02-18 09:39:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,247 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 24 treesize of output 30 [2019-02-18 09:39:00,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,257 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 26 treesize of output 40 [2019-02-18 09:39:00,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,269 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 28 treesize of output 54 [2019-02-18 09:39:00,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-18 09:39:00,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,322 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:39:00,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,372 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:39:00,474 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,497 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-18 09:39:00,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,546 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 41 treesize of output 91 [2019-02-18 09:39:00,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-18 09:39:00,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,670 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:00,672 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 43 treesize of output 106 [2019-02-18 09:39:00,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,754 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-02-18 09:39:00,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-02-18 09:39:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:00,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:00,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:00,944 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-02-18 09:39:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:03,678 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-02-18 09:39:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:03,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:39:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:03,680 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:39:03,680 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:39:03,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:39:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-18 09:39:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:39:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-02-18 09:39:03,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-02-18 09:39:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:03,692 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-02-18 09:39:03,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-02-18 09:39:03,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:39:03,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:03,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:39:03,694 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:03,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:03,694 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-02-18 09:39:03,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:03,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:03,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:03,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:03,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:03,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:03,823 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:39:03,823 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-02-18 09:39:03,824 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:03,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:03,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:03,830 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:39:03,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:03,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:03,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:03,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:03,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:03,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:03,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:03,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:39:03,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,915 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 21 treesize of output 24 [2019-02-18 09:39:03,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,920 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 24 treesize of output 30 [2019-02-18 09:39:03,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,934 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 26 treesize of output 40 [2019-02-18 09:39:03,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-18 09:39:03,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,957 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 30 treesize of output 72 [2019-02-18 09:39:03,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,991 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:39:03,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,141 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,162 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,229 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-18 09:39:04,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,277 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 41 treesize of output 91 [2019-02-18 09:39:04,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-18 09:39:04,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-02-18 09:39:04,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,528 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-02-18 09:39:04,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-02-18 09:39:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:04,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:04,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:04,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:04,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:04,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:04,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:04,718 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-02-18 09:39:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:06,698 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-02-18 09:39:06,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:39:06,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:39:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:06,700 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:39:06,700 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:39:06,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:06,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:39:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-02-18 09:39:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:39:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-02-18 09:39:06,710 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-02-18 09:39:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:06,710 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-02-18 09:39:06,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-02-18 09:39:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:39:06,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:06,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:39:06,711 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-02-18 09:39:06,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:06,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:06,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:06,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:06,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:39:06,793 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-18 09:39:06,793 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:06,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:06,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:06,801 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:39:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:06,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:06,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:06,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:06,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:06,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:06,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:06,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:39:06,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,882 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 21 treesize of output 24 [2019-02-18 09:39:06,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,887 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 24 treesize of output 30 [2019-02-18 09:39:06,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,895 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 26 treesize of output 40 [2019-02-18 09:39:06,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,907 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 28 treesize of output 54 [2019-02-18 09:39:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,966 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 30 treesize of output 72 [2019-02-18 09:39:06,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,976 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:39:06,977 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,020 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,082 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,107 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-02-18 09:39:07,108 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-18 09:39:07,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,153 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 41 treesize of output 97 [2019-02-18 09:39:07,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:07,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-18 09:39:07,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-18 09:39:07,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,387 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-02-18 09:39:07,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-18 09:39:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:07,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:07,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:07,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:39:07,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:07,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:07,544 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-02-18 09:39:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:09,194 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-02-18 09:39:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:09,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:39:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:09,196 INFO L225 Difference]: With dead ends: 77 [2019-02-18 09:39:09,197 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:39:09,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:39:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-02-18 09:39:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:39:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-02-18 09:39:09,207 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-02-18 09:39:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:09,207 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-02-18 09:39:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-02-18 09:39:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:39:09,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:09,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:39:09,208 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:09,209 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-02-18 09:39:09,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:09,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:09,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:09,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:09,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:09,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:09,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:39:09,304 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-02-18 09:39:09,306 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:09,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:09,313 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:09,314 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:39:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:09,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:09,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:09,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:09,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:09,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:09,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:09,385 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 21 treesize of output 24 [2019-02-18 09:39:09,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,396 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 24 treesize of output 30 [2019-02-18 09:39:09,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:39:09,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,414 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 28 treesize of output 54 [2019-02-18 09:39:09,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,432 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 30 treesize of output 72 [2019-02-18 09:39:09,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,461 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-18 09:39:09,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:39:09,606 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,626 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-02-18 09:39:09,627 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-18 09:39:09,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,680 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 41 treesize of output 97 [2019-02-18 09:39:09,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:09,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:09,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-18 09:39:09,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:09,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,191 INFO L303 Elim1Store]: Index analysis took 423 ms [2019-02-18 09:39:10,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-02-18 09:39:10,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,341 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-02-18 09:39:10,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-18 09:39:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:10,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:10,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:10,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:39:10,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:10,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:39:10,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:39:10,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:39:10,458 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-02-18 09:39:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:12,145 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-02-18 09:39:12,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:12,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:39:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:12,147 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:39:12,147 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:39:12,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:39:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:39:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-02-18 09:39:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:39:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-02-18 09:39:12,158 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-02-18 09:39:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:12,158 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-02-18 09:39:12,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:39:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-02-18 09:39:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:39:12,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:12,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:39:12,160 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-02-18 09:39:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:12,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:12,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:12,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:12,226 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:39:12,226 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-02-18 09:39:12,227 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:12,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:12,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:12,236 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-02-18 09:39:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:12,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:12,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:12,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:12,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:12,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:12,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:12,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-18 09:39:12,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-18 09:39:12,309 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 24 treesize of output 30 [2019-02-18 09:39:12,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,320 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 26 treesize of output 36 [2019-02-18 09:39:12,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,333 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 28 treesize of output 46 [2019-02-18 09:39:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,344 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 30 treesize of output 60 [2019-02-18 09:39:12,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,358 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-02-18 09:39:12,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,392 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,502 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-02-18 09:39:12,502 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-02-18 09:39:22,562 WARN L181 SmtUtils]: Spent 10.05 s on a formula simplification that was a NOOP. DAG size: 29 [2019-02-18 09:39:22,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-02-18 09:39:22,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 09:39:23,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-02-18 09:39:23,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-02-18 09:40:28,270 WARN L181 SmtUtils]: Spent 1.08 m on a formula simplification that was a NOOP. DAG size: 106 [2019-02-18 09:40:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:28,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:40:28,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:28,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:40:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:40:28,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:40:28,311 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-02-18 09:41:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:41:56,456 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:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. 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:191) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) ... 49 more [2019-02-18 09:41:56,460 INFO L168 Benchmark]: Toolchain (without parser) took 194435.13 ms. Allocated memory was 140.5 MB in the beginning and 358.6 MB in the end (delta: 218.1 MB). Free memory was 106.7 MB in the beginning and 325.1 MB in the end (delta: -218.4 MB). Peak memory consumption was 217.8 MB. Max. memory is 7.1 GB. [2019-02-18 09:41:56,461 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:41:56,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.46 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 104.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-02-18 09:41:56,462 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 140.5 MB. Free memory was 104.3 MB in the beginning and 103.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-18 09:41:56,462 INFO L168 Benchmark]: RCFGBuilder took 412.77 ms. Allocated memory is still 140.5 MB. Free memory was 103.1 MB in the beginning and 91.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-02-18 09:41:56,462 INFO L168 Benchmark]: TraceAbstraction took 193939.39 ms. Allocated memory was 140.5 MB in the beginning and 358.6 MB in the end (delta: 218.1 MB). Free memory was 91.1 MB in the beginning and 325.1 MB in the end (delta: -234.0 MB). Peak memory consumption was 202.2 MB. Max. memory is 7.1 GB. [2019-02-18 09:41:56,465 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.46 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 104.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 140.5 MB. Free memory was 104.3 MB in the beginning and 103.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.77 ms. Allocated memory is still 140.5 MB. Free memory was 103.1 MB in the beginning and 91.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193939.39 ms. Allocated memory was 140.5 MB in the beginning and 358.6 MB in the end (delta: 218.1 MB). Free memory was 91.1 MB in the beginning and 325.1 MB in the end (delta: -234.0 MB). Peak memory consumption was 202.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:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output.: 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...