java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:51:18,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:51:18,177 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:51:18,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:51:18,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:51:18,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:51:18,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:51:18,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:51:18,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:51:18,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:51:18,201 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:51:18,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:51:18,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:51:18,203 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:51:18,204 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:51:18,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:51:18,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:51:18,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:51:18,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:51:18,212 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:51:18,213 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:51:18,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:51:18,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:51:18,217 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:51:18,217 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:51:18,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:51:18,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:51:18,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:51:18,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:51:18,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:51:18,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:51:18,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:51:18,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:51:18,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:51:18,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:51:18,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:51:18,225 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 [2018-12-24 13:51:18,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:51:18,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:51:18,242 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:51:18,242 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:51:18,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:51:18,242 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:51:18,246 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:51:18,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:51:18,246 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:51:18,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:51:18,246 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:51:18,247 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:51:18,247 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:51:18,247 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:51:18,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:51:18,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:51:18,249 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:51:18,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:51:18,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:51:18,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:51:18,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:51:18,254 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:51:18,254 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:51:18,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:51:18,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:51:18,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:18,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:51:18,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:51:18,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:51:18,256 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:51:18,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:51:18,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:51:18,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:51:18,256 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:51:18,290 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:51:18,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:51:18,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:51:18,308 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:51:18,309 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:51:18,310 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2018-12-24 13:51:18,310 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2018-12-24 13:51:18,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:51:18,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:51:18,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:18,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:51:18,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:51:18,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:18,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:51:18,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:51:18,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:51:18,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... [2018-12-24 13:51:18,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:51:18,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:51:18,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:51:18,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:51:18,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:51:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:51:18,748 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:51:18,748 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-24 13:51:18,749 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:18 BoogieIcfgContainer [2018-12-24 13:51:18,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:51:18,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:51:18,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:51:18,754 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:51:18,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:18" (1/2) ... [2018-12-24 13:51:18,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de83724 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:51:18, skipping insertion in model container [2018-12-24 13:51:18,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:18" (2/2) ... [2018-12-24 13:51:18,758 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2018-12-24 13:51:18,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:51:18,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-24 13:51:18,800 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-24 13:51:18,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:51:18,841 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:51:18,841 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:51:18,842 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:51:18,842 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:51:18,842 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:51:18,842 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:51:18,842 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:51:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-24 13:51:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:51:18,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:18,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:51:18,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2018-12-24 13:51:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:18,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:18,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:18,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:18,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:19,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:19,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:19,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:19,101 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-24 13:51:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:19,313 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-24 13:51:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:19,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:51:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:19,329 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:51:19,329 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:51:19,333 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 [2018-12-24 13:51:19,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:51:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-12-24 13:51:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:51:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-24 13:51:19,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2018-12-24 13:51:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:19,370 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-24 13:51:19,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-24 13:51:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:19,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:19,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:19,372 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2018-12-24 13:51:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:19,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:19,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:19,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:19,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:19,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:19,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:19,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:19,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:19,417 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-12-24 13:51:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:19,505 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-24 13:51:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:19,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:51:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:19,507 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:51:19,508 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 13:51:19,509 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 [2018-12-24 13:51:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 13:51:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-24 13:51:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:51:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-12-24 13:51:19,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2018-12-24 13:51:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:19,513 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-24 13:51:19,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2018-12-24 13:51:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:19,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:19,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:19,514 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2018-12-24 13:51:19,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:19,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:19,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:19,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:19,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:19,596 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:19,598 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2018-12-24 13:51:19,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:19,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:19,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:19,713 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:19,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:19,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:19,723 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 [2018-12-24 13:51:19,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:19,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:19,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:19,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:19,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:19,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:19,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:19,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:19,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:19,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:19,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:20,161 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:20,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,361 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-12-24 13:51:20,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:20,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:20,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:20,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:20,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:20,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:51:20,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:20,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:20,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:20,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:20,568 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2018-12-24 13:51:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:20,666 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2018-12-24 13:51:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:20,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:51:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:20,668 INFO L225 Difference]: With dead ends: 13 [2018-12-24 13:51:20,669 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:51:20,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:51:20,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-24 13:51:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 13:51:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-12-24 13:51:20,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2018-12-24 13:51:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:20,674 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2018-12-24 13:51:20,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2018-12-24 13:51:20,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:20,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:20,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:20,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2018-12-24 13:51:20,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:20,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:20,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:20,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:20,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:20,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:20,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:20,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:20,784 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2018-12-24 13:51:20,788 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:20,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:20,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:20,795 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:20,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:20,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:20,796 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 [2018-12-24 13:51:20,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:20,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:20,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:20,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:20,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:20,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:20,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:20,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:21,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:21,003 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:21,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:21,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:21,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:21,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:21,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:21,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:21,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:21,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:21,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:21,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:21,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:21,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:21,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:21,225 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2018-12-24 13:51:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:21,821 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2018-12-24 13:51:21,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:21,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:51:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:21,823 INFO L225 Difference]: With dead ends: 24 [2018-12-24 13:51:21,823 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 13:51:21,824 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 [2018-12-24 13:51:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 13:51:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-24 13:51:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:51:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-12-24 13:51:21,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2018-12-24 13:51:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:21,830 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2018-12-24 13:51:21,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2018-12-24 13:51:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:21,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:21,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:21,831 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2018-12-24 13:51:21,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:21,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:21,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:21,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:21,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:21,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:21,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:21,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:21,864 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2018-12-24 13:51:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:21,895 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2018-12-24 13:51:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:21,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 13:51:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:21,896 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:51:21,896 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:51:21,897 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 [2018-12-24 13:51:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:51:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-24 13:51:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 13:51:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-12-24 13:51:21,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2018-12-24 13:51:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:21,907 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2018-12-24 13:51:21,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2018-12-24 13:51:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:21,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:21,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:21,909 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:21,909 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2018-12-24 13:51:21,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:21,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:21,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:21,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:21,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:22,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:22,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:22,016 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:22,016 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2018-12-24 13:51:22,018 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:22,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:22,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:22,029 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:22,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:22,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:22,030 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 [2018-12-24 13:51:22,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:22,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:22,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:22,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:22,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:22,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:22,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:22,267 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:22,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:22,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:22,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:22,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:22,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:22,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:22,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:22,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:22,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:22,401 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2018-12-24 13:51:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:22,566 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2018-12-24 13:51:22,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:22,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:51:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:22,568 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:51:22,568 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:51:22,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:51:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-24 13:51:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-24 13:51:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2018-12-24 13:51:22,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2018-12-24 13:51:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:22,575 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2018-12-24 13:51:22,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2018-12-24 13:51:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:22,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:22,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:22,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:22,576 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2018-12-24 13:51:22,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:22,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:22,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:22,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:22,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:22,690 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:22,690 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2018-12-24 13:51:22,693 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:22,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:22,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:22,698 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:22,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:22,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:22,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:51:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:22,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:22,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:22,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:22,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:22,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:22,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:22,856 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:22,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:22,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:22,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:22,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:22,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:22,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:22,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:23,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:23,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:23,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:23,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:23,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:23,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:23,076 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2018-12-24 13:51:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:23,345 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2018-12-24 13:51:23,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:23,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:23,347 INFO L225 Difference]: With dead ends: 35 [2018-12-24 13:51:23,347 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 13:51:23,347 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 [2018-12-24 13:51:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 13:51:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2018-12-24 13:51:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 13:51:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2018-12-24 13:51:23,353 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2018-12-24 13:51:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:23,353 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2018-12-24 13:51:23,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2018-12-24 13:51:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:23,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:23,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:23,354 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2018-12-24 13:51:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:23,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:23,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:23,392 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2018-12-24 13:51:23,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:23,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:23,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:23,399 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:23,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:23,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:23,400 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 [2018-12-24 13:51:23,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:23,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:23,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:23,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:23,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:23,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-24 13:51:23,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:23,525 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2018-12-24 13:51:23,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:23,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:23,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:23,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:51:23,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:23,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:23,630 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2018-12-24 13:51:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:23,681 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2018-12-24 13:51:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:23,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:51:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:23,683 INFO L225 Difference]: With dead ends: 30 [2018-12-24 13:51:23,683 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 13:51:23,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 13:51:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-12-24 13:51:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:51:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2018-12-24 13:51:23,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2018-12-24 13:51:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:23,692 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2018-12-24 13:51:23,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2018-12-24 13:51:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:23,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:23,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:23,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2018-12-24 13:51:23,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:23,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:23,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:23,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:23,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:23,798 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2018-12-24 13:51:23,801 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:23,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:23,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:23,806 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:23,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:23,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:23,807 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 [2018-12-24 13:51:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:23,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:23,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:23,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:23,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:23,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:23,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,897 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:23,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:23,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:23,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:23,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:23,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:23,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-24 13:51:24,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:24,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:24,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:51:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:24,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:24,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:24,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:24,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:24,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:24,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:24,327 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2018-12-24 13:51:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:24,507 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2018-12-24 13:51:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:51:24,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:24,510 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:51:24,510 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 13:51:24,511 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 [2018-12-24 13:51:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 13:51:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-12-24 13:51:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:51:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2018-12-24 13:51:24,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2018-12-24 13:51:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:24,522 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2018-12-24 13:51:24,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2018-12-24 13:51:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:24,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:24,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:24,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2018-12-24 13:51:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:24,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:24,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:24,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:24,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:24,610 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:24,610 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2018-12-24 13:51:24,612 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:24,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:24,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:24,617 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:24,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:24,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:24,618 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 [2018-12-24 13:51:24,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:24,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:24,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:24,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:24,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:24,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-24 13:51:24,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:24,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:24,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:24,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:24,694 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2018-12-24 13:51:24,745 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:24,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:24,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:24,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:24,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:24,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:24,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:24,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:24,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:24,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:24,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:24,812 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2018-12-24 13:51:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:24,938 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2018-12-24 13:51:24,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:24,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-24 13:51:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:24,944 INFO L225 Difference]: With dead ends: 38 [2018-12-24 13:51:24,944 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 13:51:24,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 13:51:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-12-24 13:51:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:51:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2018-12-24 13:51:24,956 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2018-12-24 13:51:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:24,956 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2018-12-24 13:51:24,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2018-12-24 13:51:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:24,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:24,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:24,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:24,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2018-12-24 13:51:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:24,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:24,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:24,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:25,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:25,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:25,028 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:25,028 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2018-12-24 13:51:25,031 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:25,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:25,037 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:25,038 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:25,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:25,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:25,039 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 [2018-12-24 13:51:25,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:25,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:25,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:25,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:25,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:25,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,154 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:25,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:25,272 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:25,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:25,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:25,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:25,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:25,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:25,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-24 13:51:25,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:25,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:25,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:25,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:25,518 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2018-12-24 13:51:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:25,575 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2018-12-24 13:51:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:25,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:51:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:25,578 INFO L225 Difference]: With dead ends: 38 [2018-12-24 13:51:25,578 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:51:25,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:51:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-24 13:51:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 13:51:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2018-12-24 13:51:25,597 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2018-12-24 13:51:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:25,597 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2018-12-24 13:51:25,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2018-12-24 13:51:25,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:25,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:25,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:25,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2018-12-24 13:51:25,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:25,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:25,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:25,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:25,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:51:25,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:25,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:25,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:25,761 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2018-12-24 13:51:25,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:25,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:25,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:25,768 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:25,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:25,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:25,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:25,769 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 [2018-12-24 13:51:25,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:25,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:25,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:25,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:25,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:25,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:25,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,847 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:25,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:25,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:25,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:25,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:25,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:25,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2018-12-24 13:51:25,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:25,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:25,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:26,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:26,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:26,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:26,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:26,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:26,201 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2018-12-24 13:51:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:26,407 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2018-12-24 13:51:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:51:26,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:51:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:26,409 INFO L225 Difference]: With dead ends: 37 [2018-12-24 13:51:26,409 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 13:51:26,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:51:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 13:51:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-24 13:51:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:51:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2018-12-24 13:51:26,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2018-12-24 13:51:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:26,420 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2018-12-24 13:51:26,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2018-12-24 13:51:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:26,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:26,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:26,422 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:26,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2018-12-24 13:51:26,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:26,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:26,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:26,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:26,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:26,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:26,520 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:26,521 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2018-12-24 13:51:26,523 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:26,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:26,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:26,528 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:26,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:26,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:26,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:26,528 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 [2018-12-24 13:51:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:26,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:26,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:26,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:26,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:26,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:26,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:26,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:26,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:26,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:26,611 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:26,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:26,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:26,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:26,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:26,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:26,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-12-24 13:51:26,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:26,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:26,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:51:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:26,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:26,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:26,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:26,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:26,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:26,814 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2018-12-24 13:51:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:27,265 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2018-12-24 13:51:27,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:27,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:51:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:27,266 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:51:27,267 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:51:27,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:51:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-12-24 13:51:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:51:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2018-12-24 13:51:27,278 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2018-12-24 13:51:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:27,279 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2018-12-24 13:51:27,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2018-12-24 13:51:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:27,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:27,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:27,280 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2018-12-24 13:51:27,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:27,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:27,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:27,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:27,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:27,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:27,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:27,382 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:27,383 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2018-12-24 13:51:27,384 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:27,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:27,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:27,388 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:27,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:27,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:27,389 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 [2018-12-24 13:51:27,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:27,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:27,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:27,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:27,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:27,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-24 13:51:27,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:27,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:27,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:27,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:27,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2018-12-24 13:51:27,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:27,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:27,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:27,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:27,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:27,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:51:27,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:27,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:27,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-24 13:51:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:27,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:27,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:27,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:27,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:27,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:27,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:27,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:27,677 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2018-12-24 13:51:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:27,947 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2018-12-24 13:51:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:27,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:51:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:27,949 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:51:27,949 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:51:27,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:51:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-12-24 13:51:27,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:51:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2018-12-24 13:51:27,960 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2018-12-24 13:51:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:27,961 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2018-12-24 13:51:27,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2018-12-24 13:51:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:27,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:27,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:27,962 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2018-12-24 13:51:27,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:27,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:28,212 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-12-24 13:51:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:28,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:28,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:28,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:28,219 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2018-12-24 13:51:28,220 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:28,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:28,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:28,224 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:51:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:28,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:28,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:28,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:28,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:28,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:28,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:28,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:28,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:28,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:28,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:28,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:28,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:28,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:28,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,394 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:28,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-24 13:51:28,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:28,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:28,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:28,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:28,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:28,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:28,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:28,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:28,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:28,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:51:28,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:28,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:51:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:51:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:51:28,572 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2018-12-24 13:51:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:29,024 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2018-12-24 13:51:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:51:29,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-24 13:51:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:29,025 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:51:29,026 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:51:29,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:51:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:51:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2018-12-24 13:51:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:51:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2018-12-24 13:51:29,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2018-12-24 13:51:29,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:29,036 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2018-12-24 13:51:29,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:51:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2018-12-24 13:51:29,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:51:29,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:29,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:51:29,038 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:29,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:29,038 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2018-12-24 13:51:29,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:29,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:29,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:29,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:51:29,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:29,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:29,179 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:51:29,179 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2018-12-24 13:51:29,181 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:29,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:29,185 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:29,185 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:29,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:29,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:29,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:29,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:29,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:29,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:29,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:29,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:29,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:29,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:29,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:29,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:29,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:29,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:29,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:29,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:29,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:29,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:29,498 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2018-12-24 13:51:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:29,655 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2018-12-24 13:51:29,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:51:29,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:51:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:29,656 INFO L225 Difference]: With dead ends: 29 [2018-12-24 13:51:29,657 INFO L226 Difference]: Without dead ends: 24 [2018-12-24 13:51:29,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:51:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-24 13:51:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-24 13:51:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 13:51:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2018-12-24 13:51:29,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2018-12-24 13:51:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:29,666 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2018-12-24 13:51:29,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2018-12-24 13:51:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:51:29,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:29,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:51:29,667 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2018-12-24 13:51:29,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:29,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:29,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:29,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:51:29,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:29,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:29,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:51:29,812 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2018-12-24 13:51:29,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:29,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:29,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:29,817 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:51:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:29,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:29,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:29,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:29,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:29,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:29,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:29,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:29,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-24 13:51:29,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-24 13:51:29,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,878 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-24 13:51:29,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-24 13:51:29,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:29,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:29,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:29,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-24 13:51:29,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:29,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-24 13:51:30,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,005 INFO L683 Elim1Store]: detected equality via solver [2018-12-24 13:51:30,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-24 13:51:30,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:30,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:30,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-24 13:51:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:30,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-24 13:51:30,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:30,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:51:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:51:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-24 13:51:30,096 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2018-12-24 13:51:30,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:30,322 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2018-12-24 13:51:30,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:51:30,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-24 13:51:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:30,323 INFO L225 Difference]: With dead ends: 27 [2018-12-24 13:51:30,324 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 13:51:30,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:51:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 13:51:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2018-12-24 13:51:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:51:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-12-24 13:51:30,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2018-12-24 13:51:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:30,331 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2018-12-24 13:51:30,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:51:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2018-12-24 13:51:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:51:30,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:30,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:51:30,332 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2018-12-24 13:51:30,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:30,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:51:30,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:30,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:30,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:51:30,448 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2018-12-24 13:51:30,449 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:30,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:30,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:30,453 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:30,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:30,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:30,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:30,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:30,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:30,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:30,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:30,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-24 13:51:30,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-24 13:51:30,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:30,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:30,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:30,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:30,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2018-12-24 13:51:30,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:30,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:30,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:30,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-24 13:51:30,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:30,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:51:30,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:30,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:30,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-24 13:51:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:30,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:30,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:30,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-24 13:51:30,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:30,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:30,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:51:30,784 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2018-12-24 13:51:31,223 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-12-24 13:51:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:31,462 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2018-12-24 13:51:31,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:31,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-24 13:51:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:31,463 INFO L225 Difference]: With dead ends: 14 [2018-12-24 13:51:31,463 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:51:31,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:51:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:51:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:51:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:51:31,464 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-24 13:51:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:31,464 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:51:31,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:51:31,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:51:31,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:51:31,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-24 13:51:31,677 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-24 13:51:32,570 WARN L181 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2018-12-24 13:51:32,573 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:32,573 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (let ((.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse0 (<= 0 .cse5)) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p2)) (.cse3 (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3)) (.cse4 (= 0 .cse2))) (or (and .cse0 (or (and (<= .cse1 0) (<= 1 .cse2)) (and (<= (+ .cse1 1) 0) .cse3 .cse4))) (and .cse0 (= 0 .cse1) .cse3 .cse4)))) [2018-12-24 13:51:32,573 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2018-12-24 13:51:32,573 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:32,574 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2018-12-24 13:51:32,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2018-12-24 13:51:32,574 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-24 13:51:32,574 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-24 13:51:32,574 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2018-12-24 13:51:32,585 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:51:32 BoogieIcfgContainer [2018-12-24 13:51:32,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:51:32,586 INFO L168 Benchmark]: Toolchain (without parser) took 14233.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -529.8 MB). Peak memory consumption was 276.5 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:32,587 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:32,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:32,587 INFO L168 Benchmark]: Boogie Preprocessor took 31.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:32,588 INFO L168 Benchmark]: RCFGBuilder took 297.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:32,588 INFO L168 Benchmark]: TraceAbstraction took 13834.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -551.0 MB). Peak memory consumption was 255.4 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:32,590 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 297.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13834.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.4 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -551.0 MB). Peak memory consumption was 255.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 <= #memory_int[p3] && ((#memory_int[p3 := #memory_int[p3] + 1][p2] <= 0 && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (((0 <= #memory_int[p3] && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 13.7s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 127 SDslu, 1 SDs, 0 SdLazy, 1173 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 15 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 100 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5245 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 4723 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 168 ConstructedInterpolants, 45 QuantifiedInterpolants, 9722 SizeOfPredicates, 30 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 25/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...